Applications of random sampling to on-line algorithms in computational geometry - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete and Computational Geometry Year : 1992

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.
Fichier principal
Vignette du fichier
paper.pdf (233.51 Ko) Télécharger le fichier

Dates and versions

inria-00090675 , version 1 (01-09-2006)

Identifiers

Cite

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, 1992, 8 (1), pp.51--71. ⟨10.1007/BF02293035⟩. ⟨inria-00090675⟩
164 View
116 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More