The Delaunay triangulation of a discrete point set P in general position corresponds to the dual graph of the Voronoi diagram for P. The circumcenters of Delaunay triangles are the vertices of the Voronoi diagram.

DelaunayMesh is also known as Delaunay triangulation and Delaunay tetrahedralization. It consists of intervals (in 1D), triangles (in 2D), tetrahedra (in 3D), and n-dimensional simplices (in nD).

I used Inkscape to generate this delaunay triangulation. I forgot how exactly I generated this now. Should have blogged it at that time, but my focus for my blog was only technical at that time.

Artwork created on Saturday, 29 December 2018.
Inkscape SVG