The computed Voronoi diagram returned by voronoi has the following properties:
AMD, CommonJS, and vanilla environments are supported. You can also load directly from, either as a standalone library or as part of D3 4.0. Voronoi diagrams can also be used to automate label positioning, and Delaunay meshes are useful in computing adjacency or grouping of visual elements. See “Strikeouts on the Rise” in The New York Times and this multi-line chart for examples also see Tovi Grossman’s paper on bubble cursors for a related technique. Voronoi diagrams are not only visually attractive but practical tools for interaction, such as to increase the target area of points in a scatterplot. This implementation is largely based on work by Raymond Hill. Fortune’s algorithm for computing the Voronoi diagram or Delaunay triangulation of a set of two-dimensional points. Based on Delaunator, d3-delaunay is 5-10× faster than d3-voronoi to construct the Delaunay triangulation or the Voronoi diagram, is more robust numerically, has Canvas rendering built-in, allows traversal of the Delaunay graph, and a variety of other improvements. Deprecation notice: Consider using the newer d3-delaunay instead of d3-voronoi.
0 kommentar(er)
