DOAJ Open Access 2005

Convex hull for intersections of random lines

Daniel Berend Vladimir Braverman

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Mathematics

Penulis (2)

Daniel Berend

Vladimir Braverman

Format Sitasi

APA MLA BibTeX

Berend, D., Braverman, V. (2005). Convex hull for intersections of random lines. https://doi.org/10.46298/dmtcs.3364

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.3364

Informasi Jurnal

Tahun Terbit: 2005
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.3364
Akses: Open Access ✓