The Hilbert (recursive) 2D mesh indexing, also known as a space filling curve, has recently found many applications in parallel computing and combinatorial optimisation due to its locality preserving property: given a pair of 2D mesh nodes with indices i and j, the Manhattan distance between these nodes is bounded as O(√i−j). For an application it is desirable that the constant factor hidden in the big-O and the evaluation time of an indexing scheme are minimised. In this paper we suggest a class of locality preserving indexing schemes of a 3D mesh with a smaller constant factor than previously known. We evaluate the constant factors for a number of easy to compute indexing schemes in meshes of size up to 323 and provide asymptotic analytical bounds.
[1]
D. Hilbert.
Ueber die stetige Abbildung einer Line auf ein Flächenstück
,
1891
.
[2]
John J. Bartholdi,et al.
Spacefilling curves and the planar travelling salesman problem
,
1989,
JACM.
[3]
Murray Cole,et al.
Implementing the hierarchical PRAM on the 2D mesh: analyses and experiments
,
1995,
Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing.
[4]
Christos Kaklamanis,et al.
Branch-and-bound and backtrack search on mesh-connected arrays of processors
,
1992,
SPAA '92.
[5]
D. Hilbert.
Über die stetige Abbildung einer Linie auf ein Flächenstück
,
1935
.