A new algorithm for Conforming Delaunay triangulation in 2-D is presented.The algorithm inserts points along constraint edges in order to maintain the global Delaunay criterion

while at the same time preserves the constraint edges.Compared with other strategies

our algorithm makes better use of the empty circle property in Delaunay triangulation

so that the number of extra points is greatly reduced.Corroborating experimental results are also given.