Comments on "algorithms for reporting and counting geometric intersections"

Authors:
Kevin Q. Brown
Affiliations:
Bell Laboratories, Whippany, NJ and Carnegie-Mellon University, Pittsburgh, PA
Venue:
IEEE Transactions on Computers
Year:
1981

Citing 1
Cited 4

Geometric transforms for fast geometric algorithms

Geometric transforms for fast geometric algorithms

Topological sweep of the complete graph

Discrete Applied Mathematics
Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere

Computational Geometry: Theory and Applications
Euclidean chains and their shortcuts

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Euclidean chains and their shortcuts

Theoretical Computer Science

Quantified Score

Hi-index	14.98

Visualization

Abstract

Bentley and Ottmann 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).