This work presents an algorithm that given a generalized planar graph obtains its Constrained Delaunay Triangulation (CDT). The proposed method works incrementally based in two procedures, one that inserts a new point in a CDT, and another one that inserts a new constraining edge in the CDT. In particular, an algorithm that obtains the CDT of a given polygon (possibly with holes) is obtained. These algorithms have been implemented and included in several applications, showing their robustness and efficiency, even in the case that the original graph has many vertices or edges.
CitationVigo, M. "An incremental algorithm based on edge swapping for constructing restricted Delaunay triangulations". 1995.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org