Applications of random sampling to on-line algorithms in computational geometry

Abstract : This paper presents a general framework for the design and randomized analysis of geometric algorithms. These algorithms are on-line and the framework provides general bounds for their expected space and time complexities when averaging over all permutations of the input data. The method is general and can be applied to various geometric problems. The power of the technique is illustrated by new efficient on-line algorithms for constructing convex hulls and Voronoi diagrams in any dimension, Voronoi diagrams of line segments in the plane, arrangements of curves in the plane, and others.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00090675
Contributor : Olivier Devillers <>
Submitted on : Friday, September 1, 2006 - 4:10:06 PM
Last modification on : Saturday, January 27, 2018 - 1:32:10 AM
Long-term archiving on : Tuesday, April 6, 2010 - 12:44:09 AM

Identifiers

Collections

Citation

Jean-Daniel Boissonnat, Olivier Devillers, René Schott, Monique Teillaud, Mariette Yvinec. Applications of random sampling to on-line algorithms in computational geometry. Discrete and Computational Geometry, Springer Verlag, 1992, 8 (1), pp.51--71. ⟨10.1007/BF02293035⟩. ⟨inria-00090675⟩

Share

Metrics

Record views

375

Files downloads

117