Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection
From MaRDI portal
Publication:686143
DOI10.1016/0925-7721(93)90011-TzbMATH Open0781.68120WikidataQ54309534 ScholiaQ54309534MaRDI QIDQ686143FDOQ686143
Authors: K. Mehlhorn, Micha Sharir, Emo Welzl 
Publication date: 1 November 1993
Published in: Computational Geometry (Search for Journal in Brave)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Probability Inequalities for Sums of Bounded Random Variables
- Applications of random sampling in computational geometry. II
- Applications of random sampling to on-line algorithms in computational geometry
- On the general motion-planning problem with two degrees of freedom
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Four results on randomized incremental constructions
- A tail estimate for Mulmuley's segment intersection algorithm
Cited In (6)
- A unified approach to tail estimates for randomized incremental construction
- Title not available (Why is that?)
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
- An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem
- A tail estimate for Mulmuley's segment intersection algorithm
- Markov incremental constructions
Uses Software
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)
