inria-00090675, version 1
Applications of random sampling to on-line algorithms in computational geometry
Jean-Daniel Boissonnat
1Olivier Devillers
a, 1René Schott b, 2Monique Teillaud
a, 1Mariette Yvinec
1
Discrete & Computational Geometry 8, 1 (1992) 51--71
Résumé : 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.
- a – INRIA
- b – Université Henri Poincaré - Nancy I
- 1 : PRISME (INRIA Sophia Antipolis)
- INRIA
- 2 : Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA)
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine
- Domaine : Informatique/Géométrie algorithmique
- Commentaire : http://springerlink.metapress.com/content/0k41lp212m32785l/
- inria-00090675, version 1
- http://hal.inria.fr/inria-00090675
- oai:hal.inria.fr:inria-00090675
- Contributeur : Olivier Devillers
- Soumis le : Vendredi 1 Septembre 2006, 16:10:06
- Dernière modification le : Vendredi 1 Septembre 2006, 16:41:46






Documents associés
Exporter