Tail estimates for the space complexity of randomized incremental algorithms

Authors:
Kurt Mehlhorn;Micha Sharir;Emo Welzl
Affiliations:
-;-;-
Venue:
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Year:
1992

Citing 9
Cited 0

Nonlinearity of Daveport:80Schinzel sequences and of generalized path compression schemes

Combinatorica
The complexity and construction of many faces in arrangements of lines and of segments

Discrete & Computational Geometry - Special issue on the complexity of arrangements
Applications of random sampling in computational geometry, II

Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
On the general motion-planning problem with two degrees of freedom

Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Randomized incremental construction of Delaunay and Voronoi diagrams

Proceedings of the seventeenth international colloquium on Automata, languages and programming
A fast planar partition algorithm, I

Journal of Symbolic Computation
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons

Computational Geometry: Theory and Applications
Dynamic maintenance of geometric structures made easy

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Computing a face in an arrangement of line segments

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give tail estimates for the space complexity of randomized incremental algorithms for line segment intersection in the plane. For n the number of segments, m is the number of intersections, and m ≥ n ln n ln(3) n, there is a constant c such that the probability that the total space cost exceeds c times the expected space cost is e-&OHgr;(m/(n ln n)).