I’ve rendered some images using the Voronoi Toy from my last post.
I’ve used my logo 結 (as in 結點 “node”) as the input image, run Sakri Rosenstrom’s image segmentation algorithm on it, dropped 10,000 random points into the segments, and drawn the minimum spanning tree of each set of points, thus creating a sort of space-filling tree.
The idea for this kind of fill comes from Mario Klingemann‘s presentation at FITC.
Click on each image for a larger version.
Hi, glad to see a good use of the code :) Very impressive! I was blown away by some of your older posts as well!
[...] and the Delaunay triangulation, the library also provides the convex hull, minimum and maximum spanning trees, and several other related geometric [...]
[...] minimum spanning trees as shape fills, the moving version of my earlier post The Name of the Node. On each frame one point is added, all the points move, and their spanning trees are drawn. [...]