Fractals
IFS Algorithm
Sierpinski applet.
Instructions: To zoom in on an area, highlight it with mouse by dragging out a rectangle. To zoom out press reset button.
Description: Iterated Function Systems (IFS) make possible to store a comlpex picture using a small set of numbers. Points in attractor are calculated using set of affine transformations:
xnew = ai.xold + bi.yold + ci
ynew = di.xold + ei.yold + fi
Transormation has to be narrowing. Usually it is used a set of ransformations. For each iteartion one of the transformations is randomly chosen. The process of drawing an attractor is slow, to make it faster the probalility for each transformation to be chosen is set. So points can be uniformly distributed in attractor. For example fern is drawn using parameters:
| i |
a |
b |
c |
d |
e |
f |
p |
| 1 | 0.0 |
0.0 | 0.0 |
0.16 | 0.0 |
0.0 | 0.01 |
| 2 |
0.85 | 0.04 |
0.0 | -0.04 |
0.85 | 1.6 |
0.85 |
| 3 |
0.20 | -0.26 |
0.0 | 0.23 |
0.22 | 1.6 |
0.07 |
| 4 |
-0.15 | 0.28 |
0.0 | 0.26 |
0.24 | 0.44 |
0.07 |
My e-mail address
About me.
Back to main page