-
j
Date: 04/01/08 (Algorithms) Keywords: no keywords
So this is kinda a simple technique that I think is pretty cool. For ever vertex find the vectors to it's neighbors and subtract the distance that should be between them, multiply by some small constant. Sum all them up and add it to the vertex. Rinse and repeat. I've stored it as an animated gif, it's about 3Mbytes so give it a second to download. I have two vertices that are going crazy with randomness. I think it looks creepy myself.
Source: http://community.livejournal.com/algorithms/98899.html
| « n-th order statistics of... | || | C » |