Convex hull for intersections of random lines

Daniel Berend, Vladimir Braverman

Research output: Other contributionpeer-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 languageEnglish
PublisherDMTCS
Number of pages10
ISBN (Print)1462-7264
StatePublished - 2005

Keywords

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

Fingerprint

Dive into the research topics of 'Convex hull for intersections of random lines'. Together they form a unique fingerprint.

Cite this