Recursive 3D mesh indexing with improved locality

  • George Chochia
  • Murray Cole
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1225)


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. 1.
    Hilbert, D., “Über die stetige Abbildung einer Linie auf ein Flächenstück”, Mathematische Annalen, 38, 1891, pp.459–460.Google Scholar
  2. 2.
    Chochia, G., Cole, M., and Heywood T., “Implementing the Hierarchical PRAM on the 2D Mesh: Analyses and Experiments”, In Proc. of the 7 th IEEE Symposium on Parallel and Distributed Processing, San Antonio, 1995, pp. 587–595.Google Scholar
  3. 3.
    Kaklamanis, C., and Persiano, G., “Branch-and Bound and Backtrack Search on Mesh-Connected Architectures”, Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, 1992, pp. 118–126.Google Scholar
  4. 4.
    Platzman, L.K., and Bartholdi, J.J., “Spacefilling Curves and the Planar Travelling Salesman Problem”, Journal of ACM, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • George Chochia
    • 1
  • Murray Cole
    • 1
  1. 1.Department of Computer ScienceUniversity of EdinburghUK

Personalised recommendations