Skip to main content

Space filling curves versus random walks

  • Chapter
  • First Online:
Algorithmic Foundations of Geographic Information Systems (CISM School 1996)

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abel, D.J., J.L. Smith (1983): A data structure and algorithm based on a linear key for a rectangle retrieval problem; Computer Vision, Graphics, and Image Processing, Vol. 24, 1–13

    Google Scholar 

  2. Abel, D.J., D.M. Mark (1990): A comparative analysis of some two-dimensional orderings; Intern. J. of Geographical Information Systems, Vol. 4, No. l, 21–31

    Google Scholar 

  3. Asano, T., A. Hasegawa, D. Ranjan, T. Roos (1993): Optimal and approximate digital halftoning algorithms and their experimental evaluation, Extended Abstract, Proc. Asian Conference on Computer Vision ACCV'93, Osaka

    Google Scholar 

  4. Asano, T., D. Ranjan, T. Roos (1996): Digital halftoning algorithms based on optimization criteria and their experimental evaluation, IEICE transactions on fundamentals of electronics, communications, and computer sciences, Vol. E79-A, No. 4, 1996, 524–532

    Google Scholar 

  5. Asano, T., D. Ranjan, T. Roos, E. Welzl, P. Widmayer (1995): Space filling curves and their use in the design of geometric data structures, Proc. 2nd Intern. Symp. of Latin American Theoretical Informatics LATIN'95, Valparaiso, Chile, 1995, to appear in TCS

    Google Scholar 

  6. Faloutsos, C. (1985): Multiattribute hashing using Gray codes; Proc. ACM SIGMOD International Conf. on the Management of Data, Washington D.C., 227–238

    Google Scholar 

  7. Faloutsos, C. (1988): Gray codes for partial match and range queries; IEEE Transactions on Software Engineering, Vol. 14, 1381–1393

    Google Scholar 

  8. Faloutsos, C., S. Roseman (1989): Fractals for secondary key retrieval; Proc. 8th ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, 247–252

    Google Scholar 

  9. Finkel, R.A., J.L. Bentley (1974): Quad trees: A data structure for retrieval on composite keys; Acta Informatica, Vol. 4, No. 1, 1–9

    Google Scholar 

  10. Hutflesz, A., H.-W. Six, P. Widmayer (1988): Globally order preserving multidimensional linear hashing; Proc. 4th International Conference on Data Engineering, Los Angeles, 572–579

    Google Scholar 

  11. Hutfiesz, A., P. Widmayer, C. Zimmermann (1992): Global order makes spatial access faster, International Workshop on Database Management Systems for Geographical Applications, ESPRIT Basic Research Series Proc., Springer, 161–176

    Google Scholar 

  12. Jagadish, H.V. (1990): Linear clustering of objects with multiple attributes; Proc. ACM SIGMOD International Conference on the Management of Data, Atlantic City, New Jersey, 332–342

    Google Scholar 

  13. Manola, F., J.A. Orenstein (1986): Toward a general spatial data model for an object-oriented DBMS; Proc. 12th International Conference on Very Large Data Bases, Kyoto, 328–335

    Google Scholar 

  14. Morton, G.M. (1966): A computer oriented geodetic data base and a new technique in file sequencing; IBM, Ottawa, Canada

    Google Scholar 

  15. Orenstein, J.A., T.H. Merrett (1984): A class of data structures for associative searching; Proc. 3rd ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, Waterloo, 181–190

    Google Scholar 

  16. Orenstein, J.A. (1989): Redundancy in spatial databases; Proc. ACM SIGMOD International Conference on the Management of Data, Portland, 294–305

    Google Scholar 

  17. Orenstein, J.A. (1990): A comparison of spatial query processing techniques for native and parameter spaces, Proc. ACM SIGMOD International Conference on the Management of Data, Atlantic City, New Jersey, 343–352

    Google Scholar 

  18. Samet, H. (1996): Notes on data structures, private communications

    Google Scholar 

  19. Sagan, H. (1994): Space filling curves, Springer

    Google Scholar 

  20. Tropf, H., H. Herzog (1981): Multidimensional range search in dynamically balanced trees; Angewandte Informatik, Vol. 2, 71–77

    Google Scholar 

  21. van Oosterom, P. (1990): Reactive data structures for geographic information systems; Dissertation (Proefschrift), Rijksuniversiteit Leiden

    Google Scholar 

  22. Wattenhofer, R. (1995): Raumfüllende Kurven für den Entwurf von Räumlichen Zugriffsstrukturen, Diploma thesis, ETH Zürich, Switzerland

    Google Scholar 

  23. Wood, D. (1987): Theory of Computation, Harper & Row

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marc van Kreveld Jürg Nievergelt Thomas Roos Peter Widmayer

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bugnion, E., Roos, T., Wattenhofer, R., Widmayer, P. (1997). Space filling curves versus random walks. In: van Kreveld, M., Nievergelt, J., Roos, T., Widmayer, P. (eds) Algorithmic Foundations of Geographic Information Systems. CISM School 1996. Lecture Notes in Computer Science, vol 1340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63818-0_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-63818-0_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63818-6

  • Online ISBN: 978-3-540-69653-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics