https://github.com/d3/d3-delaunay

Compute the Voronoi diagram of a set of two-dimensional points.
https://github.com/d3/d3-delaunay

Last synced: about 1 year ago
JSON representation

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

• Host: GitHub
• URL: https://github.com/d3/d3-delaunay
• Owner: d3
• License: isc
• Created: 2018-01-11T16:54:16.000Z (over 8 years ago)
• Default Branch: main
• Last Pushed: 2024-07-14T08:34:41.000Z (almost 2 years ago)
• Last Synced: 2025-04-09T03:09:48.804Z (about 1 year ago)
• Language: JavaScript
• Homepage: https://d3js.org/d3-delaunay
• Size: 5.43 MB
• Stars: 632
• Watchers: 21
• Forks: 58
• Open Issues: 1
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# d3-delaunay



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/collection/@d3/d3-delaunay)

- [Releases](https://github.com/d3/d3-delaunay/releases)

- [Getting help](https://d3js.org/community)