Realizability of Delaunay Triangulations

Abstract It is shown that any linear triangulation of a simple polygon can be realized as a (combinatorially equivalent) Delaunay triangulation. Simple examples are presented to show that neither complete triangulations of polygons nor triangulations without separating triangles are necessarily realizable as Delaunay triangulations.