The Voronoi Diagram of Planar Convex Objects

Abstract : This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smooth convex objects forming pseudo-circles set. A pseudo-circles set is a set of bounded objects such that the boundaries of any two objects intersect at most twice. Our algorithm is a randomized dynamic algorithm. It does not use a conflict graph or any sophisticated data structure to perform conflict detection. This feature allows us to handle deletions in a relatively easy way. In the case where objects do not intersect, the randomized complexity of an insertion or deletion can be shown to be respectively $O(\log^2 n)$ and $O(\log^3 n)$. Our algorithm can easily be adapted to the case of pseudo-circles sets formed by piecewise smooth convex objects. Finally, given any set of convex objects in the plane, we show how to compute the restriction of the Voronoi diagram in the complement of the objects' union.
Type de document :
Communication dans un congrès
European Symposium on Algorithms, 2003, Budapest, Hungary, 2003
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00097083
Contributeur : Mariette Yvinec <>
Soumis le : mercredi 20 septembre 2006 - 18:54:49
Dernière modification le : samedi 27 janvier 2018 - 01:31:34
Document(s) archivé(s) le : mardi 6 avril 2010 - 01:05:15

Fichiers

Identifiants

  • HAL Id : inria-00097083, version 1

Collections

Citation

Memelaos Karavelas, Mariette Yvinec. The Voronoi Diagram of Planar Convex Objects. European Symposium on Algorithms, 2003, Budapest, Hungary, 2003. 〈inria-00097083〉

Partager

Métriques

Consultations de la notice

189

Téléchargements de fichiers

337