Search the Community
Showing results for tags 'diffusion limited aggregation'.
Found 2 results
-
http://paulbourke.net/fractals/dla/ I do this in pop just to make you convenient to learning principle.In fact I think just add a new random point near by the already existent points is a more efficient way.According to the time of their existence, the tree points more longer existence the feed(walker) points being addad probability more smaller,but I haven't tried.But pop is more controllable，you can use popvop/wrangle etc.and interact with other dynamic module.About efficiency,I also thought,my algorithm is a little different.I not use tree points for pointcloud, but use feed points for pointcloud. Because the number of feed points basically gose to constant, but tree points will gose to more and more and explode. You can check and test my file. My algorithm can also be improved.My algorithm is each line generated a new primitive, but in fact this can seriously reduce the efficiency with the increase of tree.The improved algorithm is unnecessary every line generated a new primitive.When a feed point near the tree point and before connect it,we can check the number of edges has been connected of this tree point,if edge > 1 then generated a new primitive, else use the existing primitive of this tree point.But I haven't tried this algorithm. dla.hipnc
-
I'm sure lots of people have seen a recent video by Kouhei Nakama on vimeo - I'd really like to see if I can recreate this in Houdini. It looks like diffusion limited aggregation but also looks slightly different and i'm wondering if anyone has any insight on how to achieve this effect? The part i'm mostly unclear about is the leading edge of the diffusion - there seems to be an edge perpendicular to the direction of diffusion, which I don't think is common in DLA? This also looks like displacement so could this be achieved in COPs somehow and applied as a displacement map?
