A linear algorithm for computing convex hulls for random lines

Authors:
Daniel Berend;Vladimir Braverman
Affiliations:
Ben-Gurion University, Beer-Sheva, Israel;University of California, Los Angeles, CA
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2009

Citing 6
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Computing the convex hull of line intersections

Journal of Algorithms
The ultimate planar convex hull algorithm

SIAM Journal on Computing
On-line construction of the convex hull of a simple polyline

Information Processing Letters
Introduction to algorithms

Introduction to algorithms
Convex hulls for random lines

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding the convex hull of n points in the plane requires O(n log n) time in general. In Devroye and Toussaint [1993] and Golin et al. [2002] the problem of computing the convex hull of the intersection points of n lines was considered, where the lines are chosen randomly according to two various models. In both models, linear-time algorithms were developed. Here we improve the results of Devroye and Toussaint [1993] by giving a universal algorithm for a wider range of distributions.