img

Notice détaillée

An elementary proof of correctness of the Chaos Game for IFS and its hierarchical and recurrent generalizations

Article Ecrit par: Martyn, Tomek ;

Résumé: The objective of this paper is to explain the machinery of the Chaos Game used in the context of various types of iterated function system speci .cations. Although the discussion is kept in the framework of a mathematical proof, in contrast to the previous work, only the fundamentals of probability are employed. Moreover, unlike the known approaches, the way of reasoning presented in this paper is the same for all the discussed variants of the Chaos Game. As a result, the logical background of the algorithm can be followed by anyone who is interested in fractals and computer graphics.


Langue: Anglais