Minimal set of constraints for 2D constrained Delaunay reconstruction - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue International Journal of Computational Geometry and Applications Année : 2003

Minimal set of constraints for 2D constrained Delaunay reconstruction

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 triangulation. We show that this minimal set is precisely the set of non locally Delaunay edges, 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.
Fichier non déposé

Dates et versions

hal-00787186 , version 1 (11-02-2013)

Identifiants

Citer

Olivier Devillers, Regina Estkowski, Pierre-Marie Gandoin, Ferran Hurtado, Pedro Ramos, et al.. Minimal set of constraints for 2D constrained Delaunay reconstruction. International Journal of Computational Geometry and Applications, 2003, 13 (5), pp.391-398. ⟨10.1142/S0218195903001244⟩. ⟨hal-00787186⟩
130 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More