Fast N-dimensional Hilbert mapping algorithm

Proceedings - The International Conference on Computational Sciences and its Applications, ICCSA 2008

Volumn , Issue , 2008, Pages 507-513

  Chenyang, Li ^a   Hong, Zhu ^a   Nengchao, Wang ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CO-ORDINATE TRANSFORMATION; COMPUTATIONAL SCIENCES; HIGH-DIMENSIONAL; HIGHLY EFFICIENT; HILBERT; HILBERT CURVES; INTERNATIONAL CONFERENCES; MAPPING ALGORITHMS; RULE TABLE;

CONFORMAL MAPPING;

EID: 52249122880     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCSA.2008.74     Document Type: Conference Paper

References (18)

1. S. Biswas, One-dimensional B-B polynomial and Hilbert scan for graylevel image coding, Pattern Recognition, vol..37,pp.789-800, 2004.
2. A.R. Butz, Alternative algorithm for Hubert's space-filling curve, IEEE Transactions on Computers, vol. 20, pp.424-426, 1971.
3. H. Chen, Y. Chang, Neighbor-finding based on space-filling curves, Information Systems, vol. 30, pp.205-226, 2005.
4. Kuo-Liang Chung, Yi-Luen Huang and Yau-Wen Liu. Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query, Information Sciences, vol. 177, pp. 2130-2151, 2007.
5. A.J. Cole, Direct transformations between sets of integers and Hilbert polygons, International Journal of Computer Mathematics, vol. 20, pp. 115-122, 1986.
6. A.J. Cole, Compaction techniques for raster scan graphics using space-filling curves, The Computer Journal, vol. 30, pp. 87-92, 1987.
7. C. Faloutsos, S. Roseman, Fractals for secondary key retrieval, In: Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 247-252, 1989.
8. A.J. Fisher, A new algorithm for generating Hilbert curves, Software-Practice and Experience, vol. 16, pp. 5-12, 1986.
9. D. Hilbert, Uber die stetige Abbildung einer Linie auf ein Flachenstuck, Math. Ann., vol. 38, pp. 459-460, 1891.
10. G. Jin, J. Mellor-Crummey, A framework for efficient generation of multi-dimensional space-filling curves by recursion, ACM Transactions on Mathematical Software archive, vol. 31, pp. 120-148, 2005.
11. S. Kamata, R. O. Eason, and Y. Bandou, A New Algorithm for N-Dimensional Hilbert Scanning, IEEE Trans on Image Processing, vol.8, No.7, pp. 964-973, 1999.
12. J.K. Lawder. Using State Diagrams for Hilbert Curve Mappings, Technical Report JL2/00, Birkbeck College, University of London, 2000.
13. Li Chenyang, Duan Xiongwen, Feng Yucai, Algorithm For Generating N-Dimensional Hilbert Curve, China Journal of Graphics and Image, vol. 11, pp. 1068-1075, 2006.
14. Feng Yucai, Li Chenyang, Generating and Analyzing N-Dimensional Hilbert Cell, Geo-spatial Information Science, vol.8, pp. 297-305, 2005.
15. Guo-rui Feng, Ling-ge Jiang, Chen He and Yi Xue, Chaotic spread spectrum watermark of optimal space-filling curves, Chaos, Solitons & Fractals, vol 27, pp. 580-587, 2006.
16. X. Liu and G. Schrack, Encoding and decoding the Hilbert order, Software-Practice and Experience, vol. 26, pp. 1335-1346, 1996.
17. B. Moon, H.V. Jagadish, C. Faloutsos, etc., Analysis of the Clustering Properties of the Hilbert Space-Filling Curve, IEEE Transactions on knowledge and data engineering, vol.13, pp. 124-141, 2001.
18. G. Peano, Sur une courbe qui remplit touteune aire plane, Math. Ann., vol. 36, pp. 157-160, 1890.