Towards dynamic randomized algorithms in computational geometry

Monique Teillaud 1
1 PRISME - Geometry, Algorithms and Robotics
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : Computational geometry aims to design and analyze algorithms for solving geometric problem. It is a recent field of theorical computer science, that rapidly developed since it appeared in M.I Shamos' thesis in 1978. Randomization allows to avoid the use of complicated data structures, and has been proved to be very efficient, from both points of view of theoretical complexity and pratical results. We take particular interest in designing dynamic algorithms : in practice, the data of a problem are often acquired progressively. It is obviously not reasonable to compute the whole result again each time a new data is inserted, (semi-) dynamic schemes are thus necessary. We introduce a very general data structure, the influence graph, that allows us to construct various geometric structures : Voronoi diagrams, arrangements of line segments... We study both theoretical complexity and pratical efficiency of the algorithms.
Type de document :
[Research Report] RR-1727, INRIA. 1992
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : lundi 29 mai 2006 - 11:42:49
Dernière modification le : samedi 27 janvier 2018 - 01:31:34
Document(s) archivé(s) le : lundi 5 avril 2010 - 21:26:47



  • HAL Id : inria-00076966, version 1



Monique Teillaud. Towards dynamic randomized algorithms in computational geometry. [Research Report] RR-1727, INRIA. 1992. 〈inria-00076966〉



Consultations de la notice


Téléchargements de fichiers