(no subject)
Mar. 13th, 2004 12:49 pmAlgorithm
Basic
To start with, this model will consider the accumulation of partials around a single defect. The most basic Algorithm for producing DLA is outlined below:
1/ Create a blank grid with a single particle fixed in the centre.
2/ Produce a new particle at a radius rstart and a random direction from the initial particle, where rstart is slightly larger than the maximum radius of the aggregate.
3/ Move the new particle in a random direction on the grid by one grid square.
4/ Check if moving particle is adjacent to any fixed particles;
if it isn’t, go to 3
if it is, attach the particle and go to 2
The initial assumption is that this will produce a roughly spherical bundle of particles, however a little extra though or actual implementation will show that it produces something rather more complicated and interesting, as shown in Fig 1
Fig 1: an aggregate
Basic
To start with, this model will consider the accumulation of partials around a single defect. The most basic Algorithm for producing DLA is outlined below:
1/ Create a blank grid with a single particle fixed in the centre.
2/ Produce a new particle at a radius rstart and a random direction from the initial particle, where rstart is slightly larger than the maximum radius of the aggregate.
3/ Move the new particle in a random direction on the grid by one grid square.
4/ Check if moving particle is adjacent to any fixed particles;
if it isn’t, go to 3
if it is, attach the particle and go to 2
The initial assumption is that this will produce a roughly spherical bundle of particles, however a little extra though or actual implementation will show that it produces something rather more complicated and interesting, as shown in Fig 1
Fig 1: an aggregate