Skip to main content
SpringerLink
Log in

Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets

  • Conference paper
  • First Online:
Advances in Spatial Databases (SSD 1999)

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

Included in the following conference series:

Abstract

We consider the problem of performing polygonal map overlay and the refinement step of spatial overlay joins. We show how to adapt algorithms from computational geometry to solve these problems for massive data sets. A performance study with artificial and real-world data sets helps to identify the algorithm that should be used for given input data.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. P. Agarwal. Private communication. 1999.

    Google Scholar 

  2. D. Andrews, J. Snoeyink, J. Boritz, T. Chan, G. Denham, J. Harrison, and C. Zhu. Further comparison of algorithms for geometric intersection problems. In T. Waugh and R. Healey, editors, Advances in GIS Research ‐ Proceedings of the 6th International Symposium on Spatial Data Handling (SDH’94), volume 2, 709–724, 1994.

    Google Scholar 

  3. L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. Vitter. Scalable sweepingbased spatial join. In A. Gupta, O. Shmueli, and J. Widom, editors, VLDB’98: Proceedings of the 24th International Conference on Very Large Data Bases, 570–581. Morgan Kaufmann, 1998.

    Google Scholar 

  4. I. Balaban. An optimal algorithm for finding segment intersections. In Proceedings of the 11th Annual ACM Symposium on Computational Geometry, 211–219, 1995.

    Google Scholar 

  5. U. Bartuschka, K. Mehlhorn, and S. Näher. A robust and eficient implementation of a sweep line algorithm for the straight line segment intersection problem. Online-Proccedings of the First Workshop on Algorithm Engineering <http://www.dsi.unive.it/~wae97/proceeedings/ONLY_PAPERS/pap13.ps.gz>, accessed 7 Jul. 1998, 1997.

  6. J. Bentley and T. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers, C-28(9):643–647, 1979.

    Article  Google Scholar 

  7. T. Brinkho, H.-P. Kriegel, and B. Seeger. Eficient processing of spatial joins using R-trees. In P. Buneman and S. Jajoda, editors, Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, volume 22.2 of SIGMOD Record, 237–246. ACM Press, June 1993.

    Google Scholar 

  8. T. Brinkho, H.-P. Kriegel, R. Schneider, and B. Seeger. Multi-step processing of spatial joins. In R. Snodgrass and M. Winslett, editors, Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, volume 23.2 of SIGMOD Record, 197–208. ACM Press, June 1994.

    Google Scholar 

  9. A. Brinkmann and K. Hinrichs. Implementing exact line segment intersection in map overlay. In T. Poiker and N. Chrisman, editors, Proceedings of the Eighth International Symposium on Spatial Data Handling, pages 569–579. International Geographic Union, Geographic Information Science Study Group, 1998.

    Google Scholar 

  10. K. Brown. Comments on “Algorithms for reporting and counting geometric intersections”. IEEE Transactions on Computers, C-30(2):147–148, 1981.

    Google Scholar 

  11. E. Chan and J. Ng. A general and eficient implementation of geometric operators and predicates. In M. Scholl and A. Voisard, editors, Advances in Spatial Databases —Proceedings of the Fifth International Symposium on Spatial Databases (SSD’ 97), volume 1262 of Lecture Notes in Computer Science, 69–93. Springer, 1997.

    Google Scholar 

  12. T. Chan. A simple trapezoid sweep algorithm for reporting red/blue segment intersections. In Proceedings of the 6th Canadian Conference on Computational Geometry, 263–268, 1994.

    Google Scholar 

  13. B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. Journal of the ACM, 39(1):1–54, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  14. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer, Berlin, 1997.

    Google Scholar 

  15. Environmental Systems Research Institute, Inc. ARC/INFO, the world’s GIS. ESRI White Paper Series, Redlands, CA, March 1995.

    Google Scholar 

  16. U. Finke and K. Hinrichs. The quad view data structure: a representation for planar subdivisions. In M. Egenhofer and J. Herring, editors, Advances in Spatial Databases — Proceedings of the Fourth International Symposium on Spatial Databases (SSD’ 95), volume 951 of Lecture Notes in Computer Science, 29–46, 1995.

    Google Scholar 

  17. W. Franklin. Adaptive grids for geometric operations. In Proceedings of the Sixth International Symposium on Automated Cartography (Auto-Carto Six), volume 2, 230–239, 1983.

    Google Scholar 

  18. A. Giesen. Verschneidung von Regionen in Geographischen Informationssystemen (Overlaying polygonal regions in geographic information systems). Master’s thesis, University of Münster, Dept. of Computer Science, November 1998. (in German).

    Google Scholar 

  19. R. Güting and W. Schilling. A practical divide-and conquer algorithm for the rectangle intersection problem. Information Sciences, 42:95–112, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  20. Y.-W. Huang, M. Jones, and E. Rundensteiner. Improving spatial intersect using symbolic intersect detection. In M. Scholl and A. Voisard, editors, Advances in Spatial Databases — Proceedings of the Fifth International Symposium on Spatial Databases (SSD’ 97), volume 1262 of Lecture Notes in Computer Science, 165–177. Springer, 1997.

    Google Scholar 

  21. H.-P. Kriegel, T. Brinkho, and R. Schneider. An eficient map overlay algorithm based on spatial access methods and computational geometry. In Proceedings of the International Workshop on DBMS’s for Geographic Applications, 194–211, Capri, May 12–17 1991.

    Google Scholar 

  22. M.-L. Lo and C. Ravishankar. Spatial joins using seeded trees. In R. Snodgrass and M. Winslett, editors, Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, volume 23.2 of SIGMOD Record, 209–220. ACM Press, June 1994.

    Google Scholar 

  23. H. Mairson and J. Stolfi. Reporting and counting intersections between two sets of line segments. In R. Earnshaw, editor, Theoretical Foundations of Computer Graphics and CAD, volume F40 of NATO ASI, 307–325. Springer-Verlag, 1988.

    Google Scholar 

  24. J. Nievergelt and F. Preparata. Plane-sweep algorithms for intersecting geometric figures. Communications of the ACM, 25(10):739–747, 1982.

    Article  MATH  Google Scholar 

  25. J. Orenstein. A comparison of spatial query processing techniques for native and parameter spaces. In H. Garcia-Molina and H. Jagadish, editors. Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, volume 19.2 of SIGMOD Record, pages 343–352. ACM Press, June 1990.

    Google Scholar 

  26. T. Ottmann and D. Wood. Space-economical plane-sweep algorithms. Computer Vision, Graphics and Image Processing, 34:35–51, 1986.

    Article  Google Scholar 

  27. J. Pach and M. Sharir. On vertical visibility in arrangements of segments and the queue size in the Bentley-Ottmann line sweeping algorithm. SIAM Journal on Computing, 20(3):460–470, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  28. J. Patel and D. DeWitt. Partition based spatial-merge join. In H. Jagadish and I. Mumick, editors, Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, volume 25.2 of SIGMOD Record, 259–270. ACM Press, June 1996.

    Google Scholar 

  29. F. Preparata and M. Shamos. Computational Geometry: An Introduction. Springer, Berlin, 2nd edition, 1988.

    Google Scholar 

  30. M. Sharir and P. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge, 1995.

    MATH  Google Scholar 

  31. J. Vitter. External memory algorithms. In Proceedings of the 17th Annual ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS’ 98), 119–128, 1998. invited tutorial.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Westfälische Wilhelms-Universität Münster, Einsteinstr. 62, D-4815, Münster, Germany

    Ludger Becker, André Giesen, Klaus H. Hinrichs & Jan Vahrenhold

Authors
  1. Ludger Becker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. André Giesen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Klaus H. Hinrichs
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jan Vahrenhold
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Praktische Informatik IV, Fernuniversität Hagen, D-58084, Hagen, Germany

    Ralf Hartmut Güting

  2. Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong, China

    Dimitris Papadias  & Fred Lochovsky  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Becker, L., Giesen, A., Hinrichs, K.H., Vahrenhold, J. (1999). Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets. In: Güting, R.H., Papadias, D., Lochovsky, F. (eds) Advances in Spatial Databases. SSD 1999. Lecture Notes in Computer Science, vol 1651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48482-5_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-48482-5_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66247-1

  • Online ISBN: 978-3-540-48482-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation