A highly efficient algorithm for the generation of random fractal aggregates

M. R. Brown, R. Errington, P. Rees, P. R. Williams, S. P. Wilks

Research output: Contribution to journalArticle

10 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)1061-1066
Number of pages6
JournalPhysica D: Nonlinear Phenomena
Volume239
Issue number12
DOIs
StatePublished - Jun 15 2010

Keywords

  • Box-counting dimension
  • Fractal
  • Radius of gyration

ASJC Scopus subject areas

  • Condensed Matter Physics
  • Statistical and Nonlinear Physics

Fingerprint Dive into the research topics of 'A highly efficient algorithm for the generation of random fractal aggregates'. Together they form a unique fingerprint.

Cite this