Login Register

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.

See Philippe Rivière’s bl.ocks.org/1b7ddbcd71454d685d1259781968aefc for an example.

Links:

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

doc_D3_Js

2016-11-24 10:27:38

Comments

Leave a Comment

Please login to continue.

Popular Articles

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

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

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.triangles() diagram.triangles() Returns the Delaunay triangulation of the specified data array as an array of triangles. Each triangle is a three-element arra

find find() Instance Public methods Also aliased as: list