API for constructing Convex Hull, Triangulation of polygons and Delaunay triangulation of point sets.
Left: Input Polygon, Center: Simple Triangulation, Right: Constrained Delaunay Triangulation
The algorithm used for delaunay triangulation is Lawson's Edge flip algorithm.
Left: Input polygon, Center: Polygon broken into Y-monotone pieces, Right: Simple triangulation of Y-Monotone Pieces.
Algorithm used for making y montone pieces is based on Sweep line.
Left: Point Set, Center: Convex Hull and break up into left and right halfs, Right: Triangulation of both halves.
