Advertisement

On Multi-dimensional Hilbert Indexings

  • Jochen Alber
  • Rolf Niedermeier
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1449)

Abstract

Indexing schemes for grids based on space-filling curves (e.g., Hilbert indexings) find applications in numerous fields. Hilbert curves yield the most simple and popular scheme. We extend the concept of curves with Hilbert property to arbitrary dimensions and present first results concerning their structural analysis that also simplify their applicability. As we show, Hilbert indexings can be completely described and analyzed by “generating elements of order 1”, thus, in comparison with previous work, reducing their structural complexity decisively.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Alber and R. Niedermeier. On multi-dimensional Hilbert indexings. Technical Report 98-392, KAM-DIMATIA Series, Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic, May 1998.Google Scholar
  2. 2.
    A. R. Butz. Space filling curves and mathematical programming. Information and Control, 12:314–330, 1968.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    A. R. Butz. Convergence with Hilbert’s space filling curve. Journal of Computer and System Sciences, 3:128–146, 1969.zbMATHMathSciNetGoogle Scholar
  4. 4.
    G. Chochia and M. Cole. Recursive 3D mesh indexing with improved locality. Technical report, University of Edinburgh, 1997. Short version appeared in the Proceedings of HPCN’97, LNCS 1225.Google Scholar
  5. 5.
    G. Chochia, M. Cole, and T. Heywood. Implementing the Hierarchical PRAM on the 2D mesh: Analyses and experiments. In Symposium on Parallel and Distributed Processing, pages 587–595. IEEE Computer Science Press, October 1995.Google Scholar
  6. 6.
    C. Gotsman and M. Lindenbaum. On the metric properties of discrete space-filling curves. IEEE Transactions on Image Processing, 5(5):794–797, May 1996.CrossRefGoogle Scholar
  7. 7.
    H. V. Jagadish. Linear clustering of objects with multiple attributes. ACM SIGMOD Record, 19(2):332–342, June 1990.CrossRefGoogle Scholar
  8. 8.
    I. Kamel and C. Faloutsos. Hilbert R-tree: An improved R-tree using fractals. In 20th International Conference on Very Large Data Bases, pages 500–509, 1994.Google Scholar
  9. 9.
    R. Niedermeier, K. Reinhardt, and P. Sanders. Towards optimal locality in mesh-indexings. In Proceedings of the 11th Conference on Fundamentals of Computation Theory, number 1279 in Lecture Notes in Computer Science, pages 364–375, Kraków, Poland, Sept. 1997. Springer-Verlag.CrossRefGoogle Scholar
  10. 10.
    H. Sagan. A three-dimensional Hilbert curve. Int. J. Math. Educ. Sci. Technol., 24(4):541–545, 1993.zbMATHCrossRefGoogle Scholar
  11. 11.
    H. Sagan. Space-Filling Curves. Universitext. Springer-Verlag, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Jochen Alber
    • 1
  • Rolf Niedermeier
    • 1
  1. 1.Wilhelm-Schickard-Institut für InformatikUniversität TübingenTübingenFed. Rep. of Germany

Personalised recommendations