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.<>
A class of fast algorithms for the Peano-Hilbert space-filling curve
Proceedings of 1st International Conference on Image Processing ; 1 ; 638-641 vol.1
1994-01-01
395331 byte
Conference paper
Electronic Resource
English
A Class of Fast Algorithms for the Peano-Hilbert Space-Filling Curve
British Library Conference Proceedings | 1994
|Multidimensional Latent Semantic Query Using Hilbert Space Filling Curve in Peer-to-Peer Network
British Library Online Contents | 2005
|Classes of semidefinite Peano-kernels.
NTRS | 1969
|Concurrent edge/region detection from a Peano scan
IEEE | 2001
|Concurrent Edge/Region Detection from a Peano Scan
British Library Conference Proceedings | 2001
|