Login Register

diagram.triangles()

diagram.triangles()

Returns the Delaunay triangulation of the specified data array as an array of triangles. Each triangle is a three-element array of elements from data. Since the triangulation is computed as the dual of the Voronoi diagram, and the Voronoi diagram is clipped by the extent, a subset of the Delaunay triangulation is returned.

Links:

https://github.com/d3/d3-voronoi#diagram_triangles

doc_D3_Js

2025-01-10 15:47:30

Comments

Leave a Comment

Please login to continue.

Popular Articles

diagram.find() diagram.find(x, y[, radius]) Returns the nearest site to point [x, y]. If radius is specified, only sites within radius distance are considered. S

diagram diagram The computed Voronoi diagram returned by voronoi has the following properties: edges - an array of edges. cells - an array of cells, one

voronoi.triangles() voronoi.triangles(data) Returns the Delaunay triangulation of the specified data array as an array of triangles. Each triangle is a three-element

diagram.polygons() diagram.polygons() Returns an array of polygons clipped to the extent, one for each cell in the diagram. Each polygon is represented as an array o

diagram.links() diagram.links() Returns the Delaunay triangulation of the specified data array as an array of links, one for each edge in the mesh. Each link has