http://de.evo-art.org/index.php?action=history&feed=atom&title=Automatic_generation_of_iterated_function_systems 2026-04-04T13:21:18Z Versionsgeschichte dieser Seite in de_evolutionary_art_org MediaWiki 1.27.4 http://de.evo-art.org/index.php?title=Automatic_generation_of_iterated_function_systems&diff=1321&oldid=prev 2014-11-15T11:45:48Z

<p>Die Seite wurde neu angelegt: „ == Reference == Sprott, J.: Automatic generation of iterated function systems. Computers &amp; Graphics 18(3), 417–425 (1994) == DOI == http://dx.doi.org/10.1…“</p> <p><b>Neue Seite</b></p><div><br /> == Reference ==<br /> Sprott, J.: Automatic generation of iterated function systems. Computers &amp; Graphics 18(3), 417–425 (1994) <br /> <br /> == DOI ==<br /> http://dx.doi.org/10.1016/0097-8493(94)90042-6<br /> <br /> == Abstract ==<br /> A set of affine mappings with randomly chosen coefficients is repeatedly iterated numerically using the random iteration algorithm to produce an attractor with fractal characteristics. The attractor is tested for boundedness, sensitivity to initial conditions, and correlation dimension. In this way, a computer can generate a large collection of fractal patterns that are all different and most of which have considerable aesthetic appeal. A simple computer program and examples of its output are provided. Many of the attractors have been systematically evaluated for visual appeal, and a correlation is found with the Lyapunov exponent and correlation dimension.<br /> <br /> == Extended Abstract ==<br /> <br /> == Bibtex == <br /> <br /> == Used References ==<br /> <br /> <br /> <br /> == Links ==<br /> === Full Text === <br /> http://sprott.physics.wisc.edu/pubs/paper210.pdf (no c&amp;p) <br /> <br /> <br /> [[intern file]]<br /> <br /> === Sonstige Links ===<br /> http://sprott.physics.wisc.edu/pubs/paper210.htm</div>

Gbachelier