block by fil 2d10b09c5c50eee6d311ad5272b95a27

Voronoi Spanning tree - short paths

Full Screen

Using Voronoi.find(x,y) to create a spanning tree.

The strategy is to hop from any site to the nearest site that is nearer to the designated root (compare to the Voronoi spanning tree long path).

See also the colorized version.

Original work by Philippe Rivière for d3-voronoi (issue 17).