Time- and space-efficient nonrecursive algorithms, formulated directly in terms of bitwise operations, are developed to address a number of practical image scanning problems involving the Peano-Hilbert space-filling curve. These include a generator for the curve and algorithms for two-way conversion between the coordinates of a pixel and its position in the Peano-Hilbert scan. The conversion algorithms in turn lead to fast algorithms for determining the predecessor and successor of a pixel in the scan. Performance of the algorithms is assessed via analysis of their memory usage and computational requirement.<>


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A class of fast algorithms for the Peano-Hilbert space-filling curve


    Beteiligte:
    Lam, W.M. (Autor:in) / Shapiro, J.H. (Autor:in)


    Erscheinungsdatum :

    01.01.1994


    Format / Umfang :

    395331 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    A Class of Fast Algorithms for the Peano-Hilbert Space-Filling Curve

    Lam, W. M. / Shapiro, J. M. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994


    Multidimensional Latent Semantic Query Using Hilbert Space Filling Curve in Peer-to-Peer Network

    Xianghua, F. / Boqin, F. | British Library Online Contents | 2005



    Concurrent edge/region detection from a Peano scan

    Seetharaman, G. / Bouchafa, S. / Zavidovique, B. | IEEE | 2001


    Concurrent Edge/Region Detection from a Peano Scan

    Seetharaman, G. / Bouchafa, S. / Zavidovique, B. et al. | British Library Conference Proceedings | 2001