inria-00072510, version 1
Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction
Olivier Devillers
1Regina EstkowskiPierre-Marie GandoinFerran HurtadoPedro RamosVera Sacristán
N° RR-4119 (2001)
Résumé : Given a triangulation $T$ of $n$ points in the plane, we are interested in the minimal set of edges in $T$ such that $T$ can be reconstructed from this set (and the vertices of $T$) using constrained Delaunay triangulati- on. We show that this minimal set consists of the non locally Delaunay edges of $T$, and that its cardinality is less than or equal to $n+i/2$ (if $i$ is the number of interior points in $T$), which is a tight bound.
- 1 : PRISME (INRIA Sophia Antipolis)
- INRIA
- Domaine : Informatique/Autre
- Mots-clés : TRIANGULATION / DELAUNAY / $2$D / RECONSTRUCTION / MINIMAL CONSTRAINTS SET
- Référence interne : RR-4119
- inria-00072510, version 1
- http://hal.inria.fr/inria-00072510
- oai:hal.inria.fr:inria-00072510
- Contributeur : Rapport De Recherche Inria
- Soumis le : Mercredi 24 Mai 2006, 10:09:15
- Dernière modification le : Mercredi 31 Mai 2006, 14:24:26
Documents associés
Exporter