The Community for Technology Leaders
Green Image
Issue No. 02 - Feb. (1981 vol. 30)
ISSN: 0018-9340
pp: 147-148
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).
VLSI design rule checking, Computational geometry, geometric intersection problems, optimal algorithms

K. Q. Brown, "Comments on “algorithms for reporting and counting geometric intersections”," in IEEE Transactions on Computers, vol. 30, no. , pp. 147-148, 1981.
95 ms
(Ver 3.3 (11022016))