Convex hull for intersections of random lines

Daniel Berend; Vladimir Braverman

Convex hull for intersections of random lines

Daniel Berend, Vladimir Braverman

Research output: Other contribution › 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 GB
Publisher	DMTCS
Number of pages	10
ISBN (Print)	1462-7264
State	Published - 2005

Keywords

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

Cite this

@misc{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",

language = "אנגלית",

isbn = "1462-7264",

publisher = "DMTCS",

type = "Other",

}

TY - GEN

T1 - Convex hull for intersections of random lines

AU - Berend, Daniel

AU - Braverman, Vladimir

PY - 2005

Y1 - 2005

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

M3 - אחר

SN - 1462-7264

PB - DMTCS

ER -

Convex hull for intersections of random lines

Abstract

Keywords

Fingerprint

Cite this