Minimal set of constraints for 2D constrained Delaunay reconstruction - Archive ouverte HAL Access content directly
Journal Articles International Journal of Computational Geometry and Applications Year : 2003

Minimal set of constraints for 2D constrained Delaunay reconstruction

(1) , (2) , (3) , (4) , , (4)
1
2
3
4

Abstract

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.

Dates and versions

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

Identifiers

Cite

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⟩
124 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More