Plane-Sweep Algorithms for Intersecting Geometric Figures

Communications of the ACM

Volumn 25, Issue 10, 1982, Pages 739-747

  Nievergelt, J ^a   Zurich, E T H ^a   Preparata, F P ^b  

^a SWISS FEDERAL INSTITUTE OF TECHNOLOGY   (Switzerland)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

intersection problems; maps; plane sweep algorithms; polygons

Indexed keywords

EID: 84976797161     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/358656.358681     Document Type: Article

References (8)

1. A. Aho, J.E. Hopcroft, and J.D. Ullman. Analysis and Design of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. J.L. Bentley and T.A. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Trans. Computers, C-28, 9, (Sept. 1979) 643-647.
3. J.L. Bentley and D. Wood. An optimal worst case algorithm for reporting intersections of rectangles. IEEE Trans. Compters. C-29, 7, (July 1980) 571-576.
4. D.E. Knuth. The Art of Computer Programming. Vol. 3, Sorting and searching, Addison-Wesley, Reading, Mass., 1973.
5. E.M. McCreight. Efficient algorithms for enumerating intersecting intervals and rectangles. Report CSL 80-9 XEROX PARC, June 1980.
6. M.E. Newell and C.M. Sequin. The inside story on selfintersecting polygons. LAMBDA, 1, Second Quarter 1980, 20-24.
7. M.I. Shamos and D. Hoey. Closest-point problems. 16th IEEE Annual Symposium on Foundations of Computer Science. Berkeley, CA. 1975, 151-162.
8. M.I. Shamos and D. Hoey. Geometric intersection problems. 17th IEEE Annual Symposium on Foundations of Computer Science. Houston, TX. 1976, 208-215.