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.
Compute the Voronoi diagram of a set of two-dimensional points.
License
d3/d3-delaunay
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Compute the Voronoi diagram of a set of two-dimensional points.
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published