Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2001

Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction

Olivier Devillers
Regina Estkowski
  • Function : Author
Pierre-Marie Gandoin
Ferran Hurtado
  • Function : Author
Pedro Ramos
  • Function : Author
Vera Sacristán
  • Function : Author

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 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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4119.pdf (243.66 Ko) Télécharger le fichier

Dates and versions

inria-00072510 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072510 , version 1

Cite

Olivier Devillers, Regina Estkowski, Pierre-Marie Gandoin, Ferran Hurtado, Pedro Ramos, et al.. Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction. RR-4119, INRIA. 2001. ⟨inria-00072510⟩
117 View
361 Download

Share

Gmail Facebook Twitter LinkedIn More