Skip to main content

Plane Sweep Algorithm

  • Reference work entry
Encyclopedia of GIS
  • 1352 Accesses

Synonyms

Sweep line algorithm; Spatial join

Definition

The plane sweep (or sweep line) algorithm is a basic computational geometry algorithm for finding intersecting line segments. The algorithm can run in O(n lg n) time, where n is the number of line segments. This algorithm can be altered to solve many related computational‐geometry problems, such as finding intersecting polygons. In spatial databases, we are generally looking at the special case of finding the intersections of minimum bounding rectangles (MBR, see definitional entry).

Historical Background

The plane sweep algorithm, or sweep line algorithm, originated from line segment intersection problem in computational geometry field. The paper and thesis written by Michael Shamos in the middle of 1970 first addressed the computational geometry problems. Later the book [1] written by Preparata and Shamos in 1985 contributed to making people widely aware of the problems. The plane sweep algorithm is one of the main topics in the...

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

Access this chapter

Institutional subscriptions

Recommended Reading

  1. Baorzsaonyi, S., Kossmann, D., Stocker K.: The Skyline Operator. ICDE (2001)

    Google Scholar 

  2. Stojmenovic, I., Miyakawa, M.: An optimal parallel algorithm for solving the Maximal Elements Problem in the Plane. Parallel Computing (1988)

    Article  MathSciNet  MATH  Google Scholar 

  3. Matousek, J.: Computing dominance in Ên. Information processing letters (1991)

    Google Scholar 

  4. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbour Queries. SIGMOD (1995)

    Google Scholar 

  5. Hjaltason, G., Samet, H.: Distance Browsing in Spatial Databases. ACM TODS (1999)

    Google Scholar 

  6. Kossmann, D., Ramsak, F., Rost, S.: Shooting Stars in the Sky: An Online algorithm for Skyline Queries. In Proceedings of VLDB'02, pp. 275–286 (2002)

    Google Scholar 

  7. Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for Skyline Queries. ACM SIGMOD (2003)

    Google Scholar 

  8. Chomicki, J., Godfrey, P., Gryz, J., Liang D.: Skyline with Presorting. In proceedings of ICDE'03, pp. 717–816, IEEE Computer Society (2003)

    Google Scholar 

  9. Lin, X., Yuan, Y., Wang, W., Lu, H.: Stabbing the Sky: Efficient Skyline Computation over Sliding Windows. In Proceedings of ICDE'05, pp. 502–513. IEEE Comp. Soc. (2005)

    Google Scholar 

  10. Papadias, D., Tao, Y., Fu, G., Seeger, B.: Progressive Skyline Computation in Database Systems. ACM Trans. Database Syst. 30(1):41–82 (2005)

    Article  Google Scholar 

  11. Tan, K.L., Eng, P.K., Ooi, B.C.: Efficient Progressive Skyline Computation. In Proceedings of VLDB'01, pp. 301–310 (2001)

    Google Scholar 

  12. Preparata, F.P., Shamos, M.I.: Computational Geometry – An Introduction. Springer, Berlin, Heidelberg, Germany (1985)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Wood, J., Kim, S. (2008). Plane Sweep Algorithm. In: Shekhar, S., Xiong, H. (eds) Encyclopedia of GIS. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35973-1_989

Download citation

Publish with us

Policies and ethics