Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation
This paper develops two simple algorithms for constructing two- dimensional constrained Delaunay triangulations. It is shown that these algorithms can be used in building constrained polygons within a convex hull. Simple examples are presented.
scientific article; zbMATH DE number 166550
scientific article