Skip to main content

On the Locality Properties of Space-Filling Curves

  • Conference paper
Algorithms and Computation (ISAAC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2906))

Included in the following conference series:

Abstract

A discrete space-filling curve provides a linear traversal or indexing of a multi-dimensional grid space. We present an analytical study of the locality properties of the m-dimensional k-order discrete Hilbert and z-order curve families, \(\{H^m_k | k = 1,2,...\}\) and \(\{Z^m_k | k = 1,2,...\}\), respectively, based on the locality measure L δ that cumulates all index-differences of point-pairs at a common 1-normed distance δ. We derive the exact formulas for L δ (H k m) and L δ (Z k m) for m = 2 and arbitrary δ that is an integral power of 2, and m = 3 and δ = 1. The results yield a constant asymptotic ratio lim\(_{k\rightarrow\infty}\frac{L_\delta(H^m_k)}{L_\delta(Z^m_k)} > 1\), which suggests that the z-order curve family performs better than the Hilbert curve family over the considered parameter ranges.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alber, J., Niedermeier, R.: On multi-dimensional curves with Hilbert property. Theory of Computing Systems 33(4), 295–312 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Asano, T., Ranjan, D., Roos, T., Welzl, E., Widmayer, P.: Space-filling curves and their use in the design of geometric data structures. Theoretical Computer Science 181(1), 3–15 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  3. Dai, H.K., Su, H.C.: Approximation and analytical studies of interclustering performances. In: Proceedings of the 2003 Discrete Random Walks Conference (September 2003) (to appear)

    Google Scholar 

  4. Gotsman, C., Lindenbaum, M.: On the metric properties of discrete space-filling curves. IEEE Transactions on Image Processing 5(5), 794–797 (1996)

    Article  Google Scholar 

  5. Jagadish, H.V.: Analysis of the Hilbert curve for representing two dimensional space. Information Processing Letters 62(1), 17–22 (1997)

    Article  MathSciNet  Google Scholar 

  6. Mitchison, G., Durbin, R.: Optimal numberings of an N × N array. SIAM Journal on Algebraic and Discrete Methods 7(4), 571–582 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  7. Moon, B., Jagadish, H.V., Faloutsos, C., Saltz, J.H.: Analysis of the clustering properties of the Hilbert space-filling curve. IEEE Transactions on Knowledge and Data Engineering 13(1), 124–141 (2001)

    Article  Google Scholar 

  8. Pérez, A., Kamata, S., Kawaguchi, E.: Peano scanning of arbitrary size images. In: Proceedings of the International Conference on Pattern Recognition, pp. 565–568. IEEE Computer Society, Los Alamitos (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dai, H.K., Su, H.C. (2003). On the Locality Properties of Space-Filling Curves. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24587-2_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20695-8

  • Online ISBN: 978-3-540-24587-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics