Title :
Comments on “algorithms for reporting and counting geometric intersections”
Author_Institution :
Carnegie-Mellon Univ., Pittsburgh, PA, USA
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 :
computation theory; computational geometry; computational time; computer metatheory; geometric intersections; planar line segments; Algorithm design and analysis; Computers; Decoding; Encoding; Minimization; Optimization; Read only memory; Computational geometry; VLSI design rule checking; geometric intersection problems; optimal algorithms;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1981.6312179
