d3/d3-delaunay

Compute the Voronoi diagram of a set of two-dimensional points.

655

stars

265

commits

JavaScript

primary language

Nov 10, 2025

updated

d3js.org/d3-delaunay

README

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.

Resources

Contributors

mbostock

189 commits

Fil

52 commits

mourner

14 commits

tmcw

3 commits

d3/d3-delaunay

Compute the Voronoi diagram of a set of two-dimensional points.

655

stars

265

commits

JavaScript

primary language

Nov 10, 2025

updated

d3js.org/d3-delaunay

README

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.

Resources

Contributors

mbostock

189 commits

Fil

52 commits

mourner

14 commits

tmcw

3 commits

Languages

JavaScript

100.0%