Capturing Crossings: Convex Hulls of Segment and Plane Intersections

We give a simple O(n log n) algorithm to compute the convex hull of the (possibly Θ(n2 )) intersection points in an arrangement of n line segments in the plane. We also show an arrangement of dn planes in d-dimensions whose arrangement has Θ(nd−1 ) intersection points on the convex hull.

• Type: Conference
• Year: 2007
• Where: CCCG
• Authors: Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink
• Keywords: CCCG 2007, Computational Geometry, Convex Hull, Intersection Points, Line Segments