d3/d3-delaunay
1
0
Fork 0
mirror of https://github.com/d3/d3-delaunay.git synced 2026-03-19 23:54:18 +00:00
Code Issues Projects Releases Packages Wiki Activity
Compute the Voronoi diagram of a set of two-dimensional points. https://d3js.org/d3-delaunay
265 commits 4 branches 48 tags 5.8 MiB
Find a file
Exact
Joshua Horowitz afbeebfca1
 fix comment typo: collinear means "null" area, not "non-null" (#149)
2025-11-10 19:00:23 +01:00
.github Use delaunator v5; adopt type=module (#120) 2021-06-04 10:45:27 -07:00
img Swap in a less evil Georgy 2018-03-21 12:07:00 -07:00
src fix comment typo: collinear means "null" area, not "non-null" (#149) 2025-11-10 19:00:23 +01:00
test fix incorrect voronoi diagram for 5 collinear points (#147) 2024-07-14 10:34:39 +02:00
.eslintrc.json Use delaunator v5; adopt type=module (#120) 2021-06-04 10:45:27 -07:00
.gitignore Checkpoint Cell class. 2018-03-19 12:09:56 -07:00
LICENSE related d3/d3#3502; extract copyrights from LICENSE 2021-06-05 11:28:58 -07:00
package.json 6.0.4 2023-03-31 19:39:09 -07:00
README.md restructure README (#143) 2023-10-06 11:01:27 -04:00
rollup.config.js related d3/d3#3502; extract copyrights from LICENSE 2021-06-05 11:28:58 -07:00
yarn.lock update dependencies 2021-06-05 11:29:11 -07:00

README.md

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