by Zivvy Epstein and Dima Smirnov
A Delaunay triangulation for a set of points is the triangulation with the maximum minimal angle in its triangles. This is achieved by repeatedly "flipping" edges if they are inside a triangle's circumcircle.
Any simple polygon can be cut into finite pieces and stuck back together to form any other simple polygon of equal area.