d3-delaunay
Version:
Compute the Voronoi diagram of a set of two-dimensional points.
13 lines (8 loc) • 906 B
Markdown
# d3-delaunay
<a href="https://d3js.org"><img src="https://github.com/d3/d3/raw/main/docs/public/logo.svg" width="256" height="256"></a>
This is a fast library for computing the [Voronoi diagram](https://en.wikipedia.org/wiki/Voronoi_diagram) of a set of two-dimensional points. It is based on [Delaunator](https://github.com/mapbox/delaunator), a fast library for computing the [Delaunay triangulation](https://en.wikipedia.org/wiki/Delaunay_triangulation) using [sweep algorithms](https://github.com/mapbox/delaunator/blob/master/README.md#papers). The Voronoi diagram is constructed by connecting the circumcenters of adjacent triangles in the Delaunay triangulation.
## Resources
- [Documentation](https://d3js.org/d3-delaunay)
- [Examples](https://observablehq.com/@d3/-/collection/d3-delaunay)
- [Releases](https://github.com/d3/d3-delaunay/releases)
- [Getting help](https://d3js.org/community)