block by Fil 6324442dbdc08bbc2fc0d8cc1cc1cee7

Voronoi colorized spanning tree

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 (See Voronoi spanning tree 2).

We then traverse the tree to paint the cells with nice colors.

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