Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection

K. Mehlhorn, M. Sharir, E. Welzl

Research output: Contribution to journalArticlepeer-review

Abstract

We give tail estimates for the efficiency of some randomized incremental algorithms for line segment intersection in the plane. In particular, we show that there is a constant C such that the probability that the running times of algorithms due to Mulmuley (1988) and Clarkson and Shor (1989) exceed C times their expected time is bounded by e-ω(m/(n ln n)) where n is the number of segments, m is the number of intersections, and m ≥ n ln n ln(3) n.

Original languageEnglish
Pages (from-to)235-246
Number of pages12
JournalComputational Geometry: Theory and Applications
Volume3
Issue number4
DOIs
StatePublished - Sep 1993

Fingerprint

Dive into the research topics of 'Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection'. Together they form a unique fingerprint.

Cite this