E-mail

E-mail a Wiley Online Library Link

John Shier and Paul Bourke An Algorithm for Random Fractal Filling of Space Computer Graphics Forum 32

Article first published online: 29 JUL 2013 | DOI: 10.1111/cgf.12163

Thumbnail image of graphical abstract

Computational experiments with a simple algorithm show that it is possible to fill any spatial region with a random fractalization Q1 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 exponent c or the fractal dimension D can be specified ab initio over a substantial range. The method creates an infinite set of shapes whose areas (lengths, volumes) obey a power law and sum to the area (length and volume) to be filled.

Complete the form below and we will send an e-mail message containing a link to the selected article on your behalf

Required = Required Field

Choose captcha format: Image or Audio. Click here if you need help.

SEARCH