TY - JOUR
T1 - Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection
AU - Mehlhorn, K.
AU - Sharir, M.
AU - Welzl, E.
N1 - Funding Information:
by GIF project No. I-135-113.6/89 and by the ESPRIT II Basic Research EC under contract no. 7141 (project ALCOM). A preliminary version of this the 3rd ACM-SIAM Symposium on Discrete Algorithms, 1992.
PY - 1993/9
Y1 - 1993/9
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/38248999736
U2 - 10.1016/0925-7721(93)90011-T
DO - 10.1016/0925-7721(93)90011-T
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:38248999736
SN - 0925-7721
VL - 3
SP - 235
EP - 246
JO - Computational Geometry: Theory and Applications
JF - Computational Geometry: Theory and Applications
IS - 4
ER -