Skip to Main content Skip to Navigation

Vers des algorithmes dynamiques randomisés en géométrie algorithmique

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.
Document type :
Complete list of metadata

Cited literature [54 references]  Display  Hide  Download
Contributor : Olivier Devillers Connect in order to contact the contributor
Submitted on : Monday, June 10, 2013 - 3:01:40 PM
Last modification on : Friday, February 4, 2022 - 3:15:02 AM
Long-term archiving on: : Wednesday, September 11, 2013 - 4:12:56 AM


  • HAL Id : tel-00832312, version 1



Monique Teillaud. Vers des algorithmes dynamiques randomisés en géométrie algorithmique. Géométrie algorithmique [cs.CG]. Université Paris Sud - Paris XI, 1991. Français. ⟨tel-00832312⟩



Record views


Files downloads