This directory contains the source code for an optimizing simple polygon tiler.
The tiler proceeds by producing an initial triangulation of an input polygon, 
and then improving the triangulation by finding edges shared by two triangles
the vertices of which form a convex quadrilateral and switching the orientation
of the shared edge if size of the smallest circumcircle of the resulting pair 
of triangles is decreased. This is the criterion used in computing the Delaunay
Triangulation of a set of points in the plane.