Using Voronoi.find(x,y) to create a spanning tree.
The strategy is to hop from any site to the next site that is nearest to the designated root (compare with Voronoi spanning tree - short path).
Original work by Philippe Rivière for d3-voronoi (issue 17).