A linear algorithm for computing convex hulls for random lines

Daniel Berend; Vladimir Braverman

doi:10.1145/1597036.1597046

A linear algorithm for computing convex hulls for random lines

Daniel Berend, Vladimir Braverman

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

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 lineswas 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.

Original language	English
Article number	42
Journal	ACM Transactions on Algorithms
Volume	5
Issue number	4
DOIs	https://doi.org/10.1145/1597036.1597046
State	Published - 1 Oct 2009

Keywords

Computational complexity
Computational geometry
Convex hull
Random lines
Randomized algorithms

ASJC Scopus subject areas

Mathematics (miscellaneous)

Access to Document

10.1145/1597036.1597046

Cite this

@article{f32782203a7a49c5bc02a73ca44c2ef6,

title = "A linear algorithm for computing convex hulls for random lines",

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 lineswas 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.",

keywords = "Computational complexity, Computational geometry, Convex hull, Random lines, Randomized algorithms",

author = "Daniel Berend and Vladimir Braverman",

year = "2009",

month = oct,

day = "1",

doi = "10.1145/1597036.1597046",

language = "English",

volume = "5",

journal = "ACM Transactions on Algorithms",

issn = "1549-6325",

publisher = "Association for Computing Machinery (ACM)",

number = "4",

}

TY - JOUR

T1 - A linear algorithm for computing convex hulls for random lines

AU - Berend, Daniel

AU - Braverman, Vladimir

PY - 2009/10/1

Y1 - 2009/10/1

N2 - 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 lineswas 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.

AB - 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 lineswas 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.

KW - Computational complexity

KW - Computational geometry

KW - Convex hull

KW - Random lines

KW - Randomized algorithms

UR - http://www.scopus.com/inward/record.url?scp=76649124295&partnerID=8YFLogxK

U2 - 10.1145/1597036.1597046

DO - 10.1145/1597036.1597046

M3 - Article

AN - SCOPUS:76649124295

SN - 1549-6325

VL - 5

JO - ACM Transactions on Algorithms

JF - ACM Transactions on Algorithms

IS - 4

M1 - 42

ER -

A linear algorithm for computing convex hulls for random lines

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this