Delaunay Triangulation

by Kathrine Gibson, February 26, 2018

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

Some pretty examples

Delaunay triangulation 2D


Buddha Delaunay triangulation


Empire State Building Delaunay triangulation


Something wrong with this post? Edit it here.

Didn't understand something? Have a question? Ask it here.