複雑に自己組織化されたBoidの研究(<小特集>CGにおけるシミュレーション)

概要

論文の詳細を見る
Boid algorithm is first proposed by Greg Reynolds in 1989 to express some flock or grouping behavior of animals in computer graphics. The algorithm is simple and it tells only three rules to each boid in the flocks: (1) Avoid colliding each other; (2) Keep the same speed as the nearest neighbor; and (3) Fly towards the center of the flock. Giving these three rules to each boid, all boids organized into one flock and keep flying. Of course it is almost impossible to predetermine the flying paths of all boids, and the boid algorithm gives surprisingly good result with only three simple rules to express flocking behavior of animals. Numerous researches have been performed regarding to the boid and flocking algorithms. In the present report, using the boid algorithm, first, we show the transient avalanching phenomena of flocks caused by the attack of predator using a famous cell automaton named the sandpile model that that is first introduced to explain the self-organized criticality phenomena. Second, using the so-called chaos game algorithm, we show the take-off behavior of flocks from complex structures like a tree.
2002-09-15