[ trixie ]
[ sid ]
[ Källkod: node-d3-delaunay ]
Paket: node-d3-delaunay (6.0.4+~cs19.0.3-2)
Länkar för node-d3-delaunay
Debianresurser:
Hämta källkodspaketet node-d3-delaunay:
- [node-d3-delaunay_6.0.4+~cs19.0.3-2.dsc]
- [node-d3-delaunay_6.0.4+~cs19.0.3.orig-delaunator.tar.gz]
- [node-d3-delaunay_6.0.4+~cs19.0.3.orig-robust-predicates.tar.gz]
- [node-d3-delaunay_6.0.4+~cs19.0.3.orig-types-d3-delaunay.tar.gz]
- [node-d3-delaunay_6.0.4+~cs19.0.3.orig-types-delaunator.tar.gz]
- [node-d3-delaunay_6.0.4+~cs19.0.3.orig.tar.gz]
- [node-d3-delaunay_6.0.4+~cs19.0.3-2.debian.tar.xz]
Ansvariga:
Externa resurser:
- Hemsida [github.com]
Liknande paket:
Node.js fast library for computing the Voronoi diagram
node-d3-delaunay is a fast library for computing the Voronoi diagram of a set of two-dimensional points. It is based on included node-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.
Hämta node-d3-delaunay
| Arkitektur | Paketstorlek | Installerad storlek | Filer |
|---|---|---|---|
| all | 39,7 kbyte | 280,0 kbyte | [filförteckning] |