Computational geometry: an introduction
Computational geometry: an introduction
Computing the convex hull of line intersections
Journal of Algorithms
Finding the upper envelope of n line segments in O(n log n) time
Information Processing Letters
A simple algorithm for determining the envelope of a set of lines
Information Processing Letters
Journal of Algorithms
Computing faces in segment and simplex arrangements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On envelopes of arrangements of lines
Journal of Algorithms
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
| Hi-index | 0.89 |
We give a simple O(nlogn) algorithm to compute the convex hull of the (possibly @Q(n^2)) 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 @Q(n^d^-^1) intersection points on the convex hull.