[ Källkod: node-d3-voronoi ]
Paket: node-d3-voronoi (1.1.4-5)
Länkar för node-d3-voronoi
Debianresurser:
Hämta källkodspaketet node-d3-voronoi:
- [node-d3-voronoi_1.1.4-5.dsc]
- [node-d3-voronoi_1.1.4.orig.tar.gz]
- [node-d3-voronoi_1.1.4-5.debian.tar.xz]
Ansvariga:
Externa resurser:
- Hemsida [d3js.org]
Liknande paket:
Compute the Voronoi diagram of a set of two-dimensional points
This module implements Steven J. Fortune’s algorithm for computing the Voronoi diagram or Delaunay triangulation of a set of two-dimensional points. This implementation is largely based on work by Raymond Hill.
Node.js is an event-based server-side JavaScript engine.
Hämta node-d3-voronoi
| Arkitektur | Paketstorlek | Installerad storlek | Filer |
|---|---|---|---|
| all | 16,8 kbyte | 84,0 kbyte | [filförteckning] |