The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1979 vol.28)
pp: 643-647
J.L. Bentley , Departments of Computer Science and Mathematics, Carnegie-Mellon University
ABSTRACT
An interesting class of "geometric intersection problems" calls for dealing with the pairwise intersections among a set of N objects in the plane, These problems arise in many applications such as printed circuit design, architectural data bases, and computer graphics. Shamos and Hoey have described a number of algorithms for detecting whether any two objects in a planar set intersect. In this paper we extend their work by giving algorithms that count the number of such intersections and algorithms that report all such intersections.
INDEX TERMS
geometric intersection problems, Computational geometry
CITATION
J.L. Bentley, T.A. Ottmann, "Algorithms for Reporting and Counting Geometric Intersections", IEEE Transactions on Computers, vol.28, no. 9, pp. 643-647, September 1979, doi:10.1109/TC.1979.1675432
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool