Algorithm for analyzing n-dimensional hilbert curve

Authors:
Chenyang Li;Yucai Feng
Affiliations:
College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China;College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China
Venue:
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Year:
2005

Citing 5
Cited 0

Irregularity in multi-dimensional space-filling curves with applications in multimedia databases

Proceedings of the tenth international conference on Information and knowledge management
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve

IEEE Transactions on Knowledge and Data Engineering
Neighbor-finding based on space-filling curves

Information Systems
Manipulation and Presentation of Multidimensional Image Data Using the Peano Scan

IEEE Transactions on Pattern Analysis and Machine Intelligence
A new algorithm for N-dimensional Hilbert scanning

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Hilbert curve is a way of mapping the multidimensional space into the one-dimensional space. Such mappings are of interest in a number of application domains including image processing and, more recently, in the indexing of multidimensional data. However, little has been discussed on its high dimensional algorithms due to the complexity. In this paper, a novel algorithm is presented for analyzing an N-dimensional Hilbert curve, which discusses how to obtain the constructing information of an N-dimensional Hilbert curve.