This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Algorithms for Reporting and Counting Geometric Intersections
September 1979 (vol. 28 no. 9)
pp. 643-647
J.L. Bentley, Departments of Computer Science and Mathematics, Carnegie-Mellon University
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, Sept. 1979, doi:10.1109/TC.1979.1675432
Usage of this product signifies your acceptance of the Terms of Use.