An Algorithm for Random Fractal Filling of Space

Computational experiments with a simple algorithm show that it is possible to fill any spatial region with a random fractalization of any shape, with a continuous range of pre‐specified fractal dimensions D. The algorithm is presented here in 1, 2 or 3 physical dimensions. The size power‐law exponen...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computer graphics forum Jg. 32; H. 8; S. 89 - 97
Hauptverfasser:	Shier, John, Bourke, Paul
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford Blackwell Publishing Ltd 01.12.2013
Schlagworte:	Algorithms Analysis and systems Computer graphics dimension fractal Fractals G.3 [Mathematics of Computing]: Probability and Statistics-Stochastic processes geometry I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling-Geometric algorithms I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling–Geometric algorithms, languages, and systems I.3.m [Computer Graphics]: Miscellaneous languages packing space filling Studies
ISSN:	0167-7055, 1467-8659
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!