Encoding and decoding the Hilbert order

Software - Practice and Experience

Volumn 26, Issue 12, 1996, Pages 1335-1346

  Liu, Xian ^a,b   Schrack, Günther ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b NORTEL NETWORKS   (Canada)

Author keywords

Hilbert curve; Hilbert order; Space filling curves

Indexed keywords

ALGORITHMS; CURVE FITTING; DECODING; ENCODING (SYMBOLS);

HILBERT CURVE; HILBERT ORDER; SPACE FILLING CURVES;

CODES (SYMBOLS);

EID: 0030420818     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1097-024x(199612)26:12<1335::aid-spe60>3.0.co;2-a     Document Type: Article

References (7)

1. L. M. Goldschlager, 'Short algorithms for space-filling curves', Software - Practice and Experience, 11, 99 (1981).
2. J. G. Griffiths, 'Table-driven algorithms for generating space-filling curves', Computer-Aided Design, 17, 37-41 (1985).
3. N. Wirth, Algorithm+Data Structures=Programs, Prentice-Hall, Englewood Cliffs, New Jersey, 1976 (see also the second edition, 1986).
4. D. J. Abel and D. M. Mark, 'A comparative analysis of some two-dimensional orderings', Int. J. GIS., 4, 21-31 (1990).
5. C. Faloutsos and S. Roseman, 'Fractals for secondary key retrieval', Proc. ACM Conf. on the Principles of Database Systems, 247-252, (1989).
6. A. J. Fisher, 'A new algorithm for generating Hilbert curves', Software - Practice and Experience, 16, 5-12 (1986).
7. G. Schrack, 'Encoding and decoding algorithms for linear quadtrees', Tech. Rpt., Dept. of Electrical Engineering, The University of British Columbia, 1995.