Abstract
An alternative algorithm for the numerical analysis of fractal structures and measures is presented, which consumes computer time and memory only quasiproportionally to the size of the input data set. This efficient tool is applied to various deterministic and random multifractals, in particular to the growth probability measures of diffusion-limited aggregation clusters in two- and three-dimensional embedding space.
- Received 22 March 1990
DOI:https://doi.org/10.1103/PhysRevA.42.1869
©1990 American Physical Society
