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

Computers and Graphics (Pergamon)

Volumn 26, Issue 3, 2002, Pages 505-510

  Martyn, Tomek ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Fractals; Hierarchical IFS; IFS attractors; Iterated function system; Recurrent IFS; The Chaos Game

Indexed keywords

ALGORITHMS; CHAOS THEORY; FRACTALS; ITERATIVE METHODS;

HIERARCHICAL ITERATIVE FUNCTIONS; RECURRENT ITERATIVE FUNCTIONS;

COMPUTER GRAPHICS;

EID: 0036601715     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-8493(02)00092-4     Document Type: Conference Paper

References (11)

1. Fractals and self-similarity
2. Approximation of fractal sets
3. Rendering methods for iterated function systems
4. The escape buffer: Efficient computation of escape time for linear fractals
5. On approximation accuracy of the Chaos Game's finite time activity
6. On correctness of algorithms for approximation of IFS fractals
7. An ergodic theorem for iterated maps
8. Recurrent iterated function systems
9. A probabilist looks at the Chaos Game