Treffer: Algorithm for analyzing N-dimensional hilbert curve

Title:
Algorithm for analyzing N-dimensional hilbert curve
Source:
Advances in web-age information management (6th international conference, WAIM 2005, Hangzhou, China, October 11-13, 2005)Lecture notes in computer science. :657-662
Publisher Information:
New York, NY: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 8 ref 1
Original Material:
INIST-CNRS
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, 430074, China
ISSN:
0302-9743
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17265783
Database:
PASCAL Archive

Weitere Informationen

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.