Convex hull for intersections of random lines

Daniel Berend; Vladimir Braverman

doi:10.46298/dmtcs.3364

Convex hull for intersections of random lines

Daniel Berend
, Vladimir Braverman

Department of Mathematics

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

Abstract

The problem of finding the convex hull of the intersection points of random lines was studied in Devroye and Toussaint, 1993 and Langerman, Golin and Steiger, 2002, and algorithms with expected linear time were found. We improve the previous results of the model in Devroye and Toussaint, 1993 by giving a universal algorithm for a wider range of distributions.

Original language	English
Journal	Discrete Mathematics and Theoretical Computer Science
DOIs	https://doi.org/10.46298/dmtcs.3364
State	Published - Jan 2005

Keywords

Data Structures and Algorithms
Computer Science
Mathematics
Computational Geometry
Combinatorics
Human-Computer Interaction
Discrete Mathematics

Access to Document

10.46298/dmtcs.3364

Cite this

@article{32a71ee869504707b2827576fe3e6b87,

title = "Convex hull for intersections of random lines",

abstract = "The problem of finding the convex hull of the intersection points of random lines was studied in Devroye and Toussaint, 1993 and Langerman, Golin and Steiger, 2002, and algorithms with expected linear time were found. We improve the previous results of the model in Devroye and Toussaint, 1993 by giving a universal algorithm for a wider range of distributions.",

keywords = "Data Structures and Algorithms, Computer Science, Mathematics, Computational Geometry, Combinatorics, Human-Computer Interaction, Discrete Mathematics",

author = "Daniel Berend and Vladimir Braverman",

year = "2005",

month = jan,

doi = "10.46298/dmtcs.3364",

language = "English",

journal = "Discrete Mathematics and Theoretical Computer Science",

issn = "1365-8050",

publisher = "Maison de l'informatique et des mathematiques discretes",

}

TY - JOUR

T1 - Convex hull for intersections of random lines

AU - Berend, Daniel

AU - Braverman, Vladimir

PY - 2005/1

Y1 - 2005/1

N2 - The problem of finding the convex hull of the intersection points of random lines was studied in Devroye and Toussaint, 1993 and Langerman, Golin and Steiger, 2002, and algorithms with expected linear time were found. We improve the previous results of the model in Devroye and Toussaint, 1993 by giving a universal algorithm for a wider range of distributions.

AB - The problem of finding the convex hull of the intersection points of random lines was studied in Devroye and Toussaint, 1993 and Langerman, Golin and Steiger, 2002, and algorithms with expected linear time were found. We improve the previous results of the model in Devroye and Toussaint, 1993 by giving a universal algorithm for a wider range of distributions.

KW - Data Structures and Algorithms

KW - Computer Science

KW - Mathematics

KW - Computational Geometry

KW - Combinatorics

KW - Human-Computer Interaction

KW - Discrete Mathematics

U2 - 10.46298/dmtcs.3364

DO - 10.46298/dmtcs.3364

M3 - Article

SN - 1365-8050

JO - Discrete Mathematics and Theoretical Computer Science

JF - Discrete Mathematics and Theoretical Computer Science

ER -

Convex hull for intersections of random lines

Abstract

Keywords

Access to Document

Fingerprint

Cite this