Generating and AnalyzingN-di mensional Hilbert Cell

IntroductionIn 1890 ,Italian mathematician G. Peano pres-ented a family of curves which pass through allpoints in a space[1].Since the publication of thisdiscovery , many researchers have worked onthisproblem. Curves of this type have been calledPeano curves or space-filling curves .It is wellknown that space-filling curves describe a meth-od of one-to-one mapping betweenN-di mension-al space and one-di mensional space . Such map-pingis of interest in a number of application do-mains includ…

Generating and Analyzing N dimensional Hilbert Cell

In this paper, two algorithms are presented for generating two code scan lists of an N dimensional Hilbert cell, and a formal proof of the backward encoding algorithm is given. On the basis of the self similarity properties of a Hilbert curve, this paper gives a novel algorithm for generating a static evolvement rule table through analyzing a Hilbert cell. By looking up the static evolvement rule table, the N dimensional Hilbert mappings are efficiently implemented.