Constrained minimum spanning trees as shape fills, the moving version of my earlier post The Name of the Node. . . . → Read More: Trees Grow
|
In Flash we can HARNESS THE POWER OF BITMAPDATA (as it might be put in a conference session blurb) to grow Voronoi regions under differing conditions, without doing any algebra. Click on the image to launch the Voronoi Generator. Variations on Voronoi Diagrams, from Geometry in Action: One way of getting Voronoi diagrams is by growing . . . → Read More: Crystals, Evil Rangers, and Voronoi without an Engine A little code for a change. . . . → Read More: Marching Squares: Boundary detection Click on the image to see 1000 Voronoi points in motion. Keyboard controls as in the Voronoi Toy. If the popup won’t go away when you click the X, click in the movie and hit “s” to stop the moving points. I couldn’t . . . → Read More: Mona Voronita 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 . . . → Read More: The Name of the Node: Image Fill with Spanning Trees relax, v. Distributing points on the sphere by electrostatic repulsion, ported from Bulatov’s C++ code. References Distributing points on the sphere Symmetries of configurations of charges on . . . → Read More: Distributing Points on the Sphere |
||
|
Copyright © 2010 nodename - All Rights Reserved Bad Behavior has blocked 205 access attempts in the last 7 days. |
||
