Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection
From MaRDI portal
(Redirected from Publication:686143)
Recommendations
Cites work
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- A tail estimate for Mulmuley's segment intersection algorithm
- Applications of random sampling in computational geometry. II
- Applications of random sampling to on-line algorithms in computational geometry
- Four results on randomized incremental constructions
- On the general motion-planning problem with two degrees of freedom
- Probability Inequalities for Sums of Bounded Random Variables
Cited in
(6)- A unified approach to tail estimates for randomized incremental construction
- A tail estimate for Mulmuley's segment intersection algorithm
- An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem
- Markov incremental constructions
- scientific article; zbMATH DE number 742952 (Why is no real title available?)
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
This page was built for publication: Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686143)