Delaunay Triangulation is a trigonometrical technique that creates a triangular mesh, avoiding sliver triangles. Here's a more formal definition.

## How to Implement

There are five algorithms to compute Delaunay triangulations but all rely on the making a polygon into a bunch of triangles and then making sure no point is in the circumcircle of any triangle.

## What is this used for

- To create nice triangular meshes for graphic design, numerical analysis, modeling terrain, etc
- Minimum spanning trees
- Voronoi diagrams