Algorithm for analyzing N-dimensiomal Hilbert curve

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 Hubert curve, which discusses how to obtain the constructing information of an N-dimensional Hilbert curve. © Springer-Verlag Berlin Heidelberg 2005.