A simple algorithm for constructing fractal aggregates with pre-determined fractal dimension Original Research Article

We present an algorithm which allows to construct fractal aggregates, composed of equal-sized grains, with pre-determined fractal dimension. The basic idea consists in growing the aggregates by adding grains at that position where the local filling factor is smallest. We then show that there exists an approximately linear relationship between the fractal dimension and the detector radius by which the local filling factor is determined. Fractal dimensions between 1.7 and 3.0 have been realized as examples for aggregates containing 102–104 grains.