Geometric intersection problems
Michael Ian Shamos, Dan Hoey · Annual Symposium on Foundations of Computer Science · 1976
We develop optimal algorithms for forming the intersection of geometric objects in the plane and apply them to such diverse problems as linear programming, hidden-line elimination, and wire layout. Given N line segments in the plane, finding all intersecting pairs requires O(N2) time. We give an O(N log N) algorithm to determine whether any two intersect and use it to detect whether two simple plane polygons intersect. We employ an O(N log N) algorithm for finding the common intersection of N half-planes to show that the Simplex method is not optimal. The emphasis throughout is on obtaining upper and lower bounds and relating these results to other problems in computational geometry.
Cited by 469 works. doi:10.1109/sfcs.1976.16
Authors
References
- The Design and Analysis of Computer Algorithms
- Closest-point problems
- Geometric complexity
- Measuring Concavity on a Rectangular Mosaic
- On the Optimality of Some Set Algorithms
- Analysis of set patterns
- On the complexity of computations under varying sets of primitives
- Representation of figures by labeled graphs