This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Kevin Q. Brown, Carnegie-Mellon University, Pittsburgh, PA; Bell Laboratories, Whippany, NJ 07981
Bentley and Ottmann1 present an algorithm for reporting all K intersections among N planar line segments in 0((N + K) log N) time and 0(N + K) storage. With a small modification that storage requirement can be reduced to 0(N) with no increase in computation time, which is important because K can grow as θ(N2).
Index Terms:
VLSI design rule checking,Computational geometry,geometric intersection problems,optimal algorithms
Citation:
Kevin Q. Brown, "Comments on “algorithms for reporting and counting geometric intersections”," IEEE Transactions on Computers, vol. 30, no. 2, pp. 147-148, Feb. 1981, doi:10.1109/TC.1981.6312179
Usage of this product signifies your acceptance of the Terms of Use.