Comments on “algorithms for reporting and counting geometric intersections”
- 1 February 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-30 (2) , 147-148
- https://doi.org/10.1109/TC.1981.6312179
Abstract
Comments on the paper by Bentley and Ottman (ibid., vol.28, p.643-7, 1979) which presents 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 computational time, which is important because K can grow as 0(N2).Keywords
This publication has 0 references indexed in Scilit: