A highly efficient algorithm for the generation of random fractal aggregates (Q979119)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5726646
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A highly efficient algorithm for the generation of random fractal aggregates |
scientific article; zbMATH DE number 5726646 |
Statements
A highly efficient algorithm for the generation of random fractal aggregates (English)
0 references
25 June 2010
0 references
The technique of generation of random fractal aggregates (RFA) with pre-determined fractal dimension is reported and validated. The method is highly efficient, of \(O(N_{\text{total}})\), where \(N_{\text{total}}\) is the number of particles within the RFA, and is numerically simple to implement. Further, the algorithm poses no limit on the magnitude of the fractal dimension.
0 references
fractal
0 references
box-counting dimension
0 references
radius of gyration
0 references
0.7614824175834656
0 references
0.7495151162147522
0 references
0.7495151162147522
0 references
0.7152443528175354
0 references
0.6987348794937134
0 references
