Name
Abstract | ||
|---|---|---|
We develop a novel construction method for n-dimensional Hilbert space-filling curves. The construction method includes four steps: block allocation, Gray permutation, coordinate transformation and recursive construction. We use the tensor product theory to formulate the method. An n-dimensional Hilbert space-filling curve of 2(r) elements on each dimension is specified as a permutation which rearranges 2(rn) data elements stored in the row major order as in C language or the column major order as in FORTRAN language to the order of traversing an n-dimensional Hilbert space-filling curve. The tensor product formulation of n-dimensional Hilbert space-filling curves uses stride permutation, reverse permutation, and Gray permutation. We present both recursive and iterative tensor product formulas of n-dimensional Hilbert space-tilling curves. The tensor product formulas are directly translated into computer programs which can be used in various applications. The process of program generation is explained in the paper. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1587/transinf.E93.D.1807 | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS |
Keywords | DocType | Volume |
block recursive algorithm, tensor product, n-dimensional Hilbert space-filling curve, Gray permutation | Journal | E93D |
Issue | ISSN | Citations |
7 | 1745-1361 | 0 |
PageRank | References | Authors |
0.34 | 15 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chih-Sheng Chen | 1 | 4 | 2.80 |
| Shen-yi Lin | 2 | 5 | 1.16 |
| Min-hsuan Fan | 3 | 17 | 3.41 |
| Chua-huang Huang | 4 | 281 | 35.34 |