top of page
  • Writer's pictureDhara Patel

Duality of Voronoi and Delaunay

Updated: Dec 17, 2020

The Delaunay triangulation is the straight-line dual of the Voronoi diagram. This means you can use a Voronoi diagram to generate a Delaunay triangulation and you can use a Delaunay triangulation to generate a Voronoi diagram. The process of generating a Voronoi diagram from the Delaunay triangulation is called Naive Algorithm. [Ringler]

Red = Delaunay triangulation, Black = Voronoi diagram

Image Source: [Wikipedia]

When you read the topic post on Delaunay triangulation, you found that we circumscribe four co-circular points on the Delaunay triangulation. The edges that connect these circumscibed points have perpendicular bisectors. These perpendicular bisectors represent the edges of our Voronoi diagram! And, where they intersect is a site on the Voronoi diagram. [Mitchell]

Each edge of a triangle interior to the convex hull shares its edges with adjacent triangles. If a point within the convex hull were not contained by a triangle, then, projecting a line out from that point in any direction would cross an edge which was not shared with any other triangle. This is a contradiction, therefore all points within the hull are contained by exactly one triangle of the dual. [Fortune]

Image Source: [Wikipedia]

A more detailed proof of how Delaunay triangulation can be used to generate Voronoi diagrams here.



Fortune, Steven. “Voronoi Diagrams and Delaunay Triangulations.” Discrete and Computational Geometry, CRC Press, 2017, pp. 705 - 721., Accessed 2020.

Mitchell, Joseph. “Voronoi and Delaunay Diagrams.” An Introduction to Computational Geometry, State University of New York, Accessed 2020.

Ringler, Todd. “Introduction to Voronoi Diagrams and Delaunay Triangulations.” Clasp Research, Los Almos National Laboratory, 2008, Accessed 2020.

Wikipedia. “Delaunay Triangulation.” Wikipedia, Wikipedia, 2020, Accessed 2020.


Recent Posts

See All


bottom of page