I would also mention that English is not my first language. So, I would appreciate comments on how to better this text from that point of view. Thanks.
This method uses some IFS formulas that I have taken in "Fractal programming in C", by Roger Stevens, M&T Publishing, 1989, ISBN 1-55851-038-9, p.394 to 397. These are formulas to obtain Sierpinsky triangle, fern leaves, fractal trees and Cantor trees by using the Chaos algorithm (there are some other algorithms related to IFS).
As you will remark by using the colouring method, you will get none of the four figures. I did not have any intent of making IFS in UF by converting the programs of this book to UF code. My intent was more to see 'what if?'.
Here are the parameters for this colouring method. For those related to the Chaos, take a look there. It also uses the Masking Parameters Toolbox.
Colouring Mode | The goal of this parameter is using some properties of the formula for coloration. |
Choices | When French: Distance min (default), magnitude min,
itération min, réel min, imaginaire min, angle min, distance
max, magnitude max, itération max, réel max, imaginaire max,
angle max
When English: Distance min (default), magnitude min, iteration min, real min, imaginary min, angle min, distance max, magnitude max, iteration max, real max, imaginary max, angle max |
Figure | This is where to choose among the different figures. |
Choices | When French: Sierpinsky (default), fougère,
arbre,
arbre
de Cantor
When English: Sierpinsky (default), fern, tree, Cantor tree |