Reporting Intersections of Polygons

References

• Bentley , J. L. and Ottmann , T. A. 1979 . Algorithms for reporting and counting geometric intersections . IEEE Trans. Computers , C-28 ( 9 ) : 643 – 647 .
   Web of Science ®Google Scholar
• Bentley , J. L. and Wood , D. 1980 . An optimal worst case algorithm for reporting intersections of rectangles . IEEE Trans. Computers , C-29 ( 7 ) : 571 – 576 .
   Web of Science ®Google Scholar
• Brown , K. Q. 1981 . Algorithms for Reporting and Counting Geometric Intersections . IEEE Trans. Computers , C-30 ( 7 ) : 147 – 148 .
   Google Scholar
• Nievergelt , J. and Preparata , F. P. 1982 . Plane sweeping algorithms for intersecting figures . Comm. of the ACM , 25 ( 10 ) : 739 – 747 .
   Web of Science ®Google Scholar
• Ottmann T. Wood D. The contour problem for polygons Report CS-84–33 University of Waterloo Computer Science 1984
   Google Scholar
• Ottmann , T. and Widmayer , P. . Proceedings of MFCS'84 . Solving visibility problems by using skeleton structures . Vol. 176 , pp. 459 – 170 . Springer-Verlag Lecture Notes in Computer Science .
   Google Scholar
• Shamos , M. I. and Hoey , D. . 17th IEEE Annual Symposium on Foundations of Computer Science . Geometric intersection problems . pp. 208 – 215 . Houston : Texas .
   Google Scholar