Abstract This work presents an algorithm that given a generalized planar graph obtains its Constrained Delaunay triangulation (CDT). The proposed method, which follows the general approach of de Floriani and Puppo ( Computer Vision, Graphics and Image Processing , 1992, 54 , pp. 290–300, [1]), works incrementally based on two improved procedures. The first improvement gives a procedure that inserts a new point in a CDT; the second one is an algorithm that enforces a new constraining edge in a CDT. In particular, an algorithm that generates the CDT of a given polygon (possibly with holes) is also obtained. These algorithms have been implemented and included in several applications, showing their robustness and efficiency, even when the original graph has many vertices or edges.
[1]
Robin Sibson,et al.
Computing Dirichlet Tessellations in the Plane
,
1978,
Comput. J..
[2]
Leila De Floriani,et al.
An on-line algorithm for constrained Delaunay triangulation
,
1992,
CVGIP Graph. Model. Image Process..
[3]
D. T. Lee,et al.
Generalized delaunay triangulation for planar graphs
,
1986,
Discret. Comput. Geom..
[4]
C. Lawson.
Software for C1 Surface Interpolation
,
1977
.
[5]
Adrian Bowyer,et al.
Computing Dirichlet Tessellations
,
1981,
Comput. J..
[6]
S. Sloan.
A fast algorithm for constructing Delaunay triangulations in the plane
,
1987
.