A highly efficient algorithm for the generation of random fractal aggregates

A technique to generate random fractal aggregates where the fractal dimension is fixed a priori is presented. The algorithm utilizes the box-counting measure of the fractal dimension to determine the number of hypercubes required to encompass the aggregate, on a set of length scales, over which the structure can be defined as fractal. At each length scale the hypercubes required to generate the structure are chosen using a simple random walk which ensures connectivity of the aggregate. The algorithm is highly efficient and overcomes the limitations on the magnitude of the fractal dimension encountered by previous techniques.