DLA算法

gaoyi2006 · 发表于 2011-7-29 12:09:51

Diffusion-Limited Aggregation (DLA)
1.Establish a large circle
2.Launch a random walk from the large circle at a random angle (uniform distribution)
3.At each step of the random walk check whether the random walker is near the aggregate. If so, attach the
last point of the walk the aggregate on the lattice.
4.At each step of the random walk check that the random walk has not gone beyond the large circle. If so,
stop the walk.
5.Repeat the same procedure of launching a new random walk in the large circle until the maximum number
of walks has been reached or the aggregate has reached the specified size.

附件为SUPERMANOEUVRE和kokkugia的程序。
以下为AA的一个workshop

rhinoscript dla.rvb (4.35 KB, 下载次数: 55, 售价: 5 lux照度)

帐号		自动登录	找回密码
密码			注册

[网络资源] DLA算法

评分