Constrained Delaunay Triangulation Using Delaunay Visibility - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Constrained Delaunay Triangulation Using Delaunay Visibility

Hui Zhang
  • Function : Author
Wei Zeng
  • Function : Author
Jiaguang Sun
  • Function : Author


An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional visibility with Delaunay visibility. With Delaunay visibility introduced, all strongly Delaunay edges are excluded from the computation of visibility. Furthermore, a sufficient condition for DT (CDT whose triangles are all Delaunay) existence is presented to decrease the times of visibility determinations. The mesh generator is robust and exhibits a linear time complexity for randomly generated PSLGs.

Dates and versions

inria-00139015 , version 1 (28-03-2007)



Yi-Jun Yang, Hui Zhang, Jun-Hai Yong, Wei Zeng, Jean-Claude Paul, et al.. Constrained Delaunay Triangulation Using Delaunay Visibility. Advances in Visual Computing, Second International Symposium, ISVC 2006, Proceedings part I, Nov 2006, Lake Tahoe / USA, ⟨10.1007/11919476⟩. ⟨inria-00139015⟩
142 View
0 Download



Gmail Facebook Twitter LinkedIn More