Space filling curves versus random walks

  • Edouard Bugnion
  • Thomas Roos
  • Roger Wattenhofer
  • Peter Widmayer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1340)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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–13Google Scholar
  2. 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–31Google Scholar
  3. 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, OsakaGoogle Scholar
  4. 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–532Google Scholar
  5. 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 TCSGoogle Scholar
  6. 6.
    Faloutsos, C. (1985): Multiattribute hashing using Gray codes; Proc. ACM SIGMOD International Conf. on the Management of Data, Washington D.C., 227–238Google Scholar
  7. 7.
    Faloutsos, C. (1988): Gray codes for partial match and range queries; IEEE Transactions on Software Engineering, Vol. 14, 1381–1393Google Scholar
  8. 8.
    Faloutsos, C., S. Roseman (1989): Fractals for secondary key retrieval; Proc. 8th ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, 247–252Google Scholar
  9. 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–9Google Scholar
  10. 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–579Google Scholar
  11. 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–176Google Scholar
  12. 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–342Google Scholar
  13. 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–335Google Scholar
  14. 14.
    Morton, G.M. (1966): A computer oriented geodetic data base and a new technique in file sequencing; IBM, Ottawa, CanadaGoogle Scholar
  15. 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–190Google Scholar
  16. 16.
    Orenstein, J.A. (1989): Redundancy in spatial databases; Proc. ACM SIGMOD International Conference on the Management of Data, Portland, 294–305Google Scholar
  17. 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–352Google Scholar
  18. 18.
    Samet, H. (1996): Notes on data structures, private communicationsGoogle Scholar
  19. 19.
    Sagan, H. (1994): Space filling curves, SpringerGoogle Scholar
  20. 20.
    Tropf, H., H. Herzog (1981): Multidimensional range search in dynamically balanced trees; Angewandte Informatik, Vol. 2, 71–77Google Scholar
  21. 21.
    van Oosterom, P. (1990): Reactive data structures for geographic information systems; Dissertation (Proefschrift), Rijksuniversiteit LeidenGoogle Scholar
  22. 22.
    Wattenhofer, R. (1995): Raumfüllende Kurven für den Entwurf von Räumlichen Zugriffsstrukturen, Diploma thesis, ETH Zürich, SwitzerlandGoogle Scholar
  23. 23.
    Wood, D. (1987): Theory of Computation, Harper & RowGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Edouard Bugnion
    • 1
  • Thomas Roos
    • 2
  • Roger Wattenhofer
    • 3
  • Peter Widmayer
    • 4
  1. 1.Stanford UniversityDept. of Computer ScienceUSA
  2. 2.Dept. of Computer ScienceETH ZürichSwitzerland
  3. 3.Dept. of Computer ScienceETH ZürichSwitzerland
  4. 4.Dept. of Computer ScienceETH ZürichSwitzerland

Personalised recommendations