The chaos game revisited: Yet another, but a trivial proof of the algorithm's correctness

DOI10.1016/j.aml.2011.08.020zbMath1232.65178OpenAlexW2058142130MaRDI QIDQ659841

Tomasz Martyn

Publication date: 24 January 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.08.020

zbMATH Keywords

iterated function systemfractalchaos gameIFS attractor

Mathematics Subject Classification ID

Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Fractals (28A80) Numerical chaos (65P20)

Related Items (3)

Algorithms generating images of attractors of generalized iterated function systems ⋮ Contractive iterated function systems enriched with nonexpansive maps ⋮ Weakly contractive iterated function systems and beyond: a manual

Cites Work

• Recurrent iterated function systems
• An ergodic theorem for iterated maps
• A classical ergodic property for IFS: a simple proof
• Unnamed Item
• Unnamed Item

This page was built for publication: The chaos game revisited: Yet another, but a trivial proof of the algorithm's correctness