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).