Comments on “algorithms for reporting and counting geometric intersections” | IEEE Journals & Magazine | IEEE Xplore

Comments on “algorithms for reporting and counting geometric intersections”


Abstract:

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 modif...Show More

Abstract:

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).
Published in: IEEE Transactions on Computers ( Volume: C-30, Issue: 2, February 1981)
Page(s): 147 - 148
Date of Publication: 28 February 1981

ISSN Information: