HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

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 metadata

Contributor : Olivier Devillers Connect in order to contact the contributor
Submitted on : Friday, September 1, 2006 - 4:10:06 PM
Last modification on : Friday, February 4, 2022 - 3:29:35 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 12:44:09 AM




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⟩



Record views


Files downloads