d3-delaunay

This is a fast library for computing the Voronoi diagram of a set of two-dimensional points. It is based on Delaunator, a fast library for computing the Delaunay triangulation using sweep algorithms. The Voronoi diagram is constructed by connecting the circumcenters of adjacent triangles in the Delaunay triangulation.

See one of:

• Delaunay triangulations
• Voronoi diagrams

For an interactive explanation of how this library works, see The Delaunay’s Dual.