This is a fast library for computing theVoronoi diagramof a set of two-dimensional points. It is based onDelaunator,a fast library for computing theDelaunay triangulationusingsweep algorithms.The Voronoi diagram is constructed by connecting the circumcenters of adjacent triangles in the Delaunay triangulation.
-
Notifications
You must be signed in to change notification settings - Fork 55
Compute the Voronoi diagram of a set of two-dimensional points.
License
d3/d3-delaunay
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Latest commit | ||||
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