Partial triangulation completion algorithm (limited triangulation)

Question

Given the many points in the plane and the incomplete triangulation of the convex hull of the points (only some edges are specified), I’m looking for an algorithm to complete the triangulation (the original given edges should remain fixed). You can assume that it is possible to perform partial triangulation, but it would be great if would you also suggest an algorithm to verify this.

UPDATE “You are given the convex hull of the set of points R ^ 2, which is basically a polygon with some points inside it. We want to triangulate the set of points that are rectilinear matter on itself, but you” Also given are some edges that are any triangulation that you come up with must use these ribs. "

Answer 1

This may be a naive answer, but can't you use delaunay limited triangulation? Add known edges as constraints.

CGAL . triangle , () .

Answer 2

, " : " , .

- , , , . , O (n ^ 2 log n).

O (n log n), , .