Capturing crossings: Convex hulls of segment and plane intersections |
| |
Authors: | Esther M Arkin Jack Snoeyink |
| |
Affiliation: | a AMS SUNY Stony Brook, USA b CS UNC Chapel Hill, USA |
| |
Abstract: | We give a simple O(nlogn) 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 hyperplanes in d-dimensions whose arrangement has Θ(nd−1) intersection points on the convex hull. |
| |
Keywords: | Computational geometry Analysis of algorithms |
本文献已被 ScienceDirect 等数据库收录! |