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

DOI10.1016/J.AML.2011.08.020zbMATH Open1232.65178OpenAlexW2058142130MaRDI QIDQ659841FDOQ659841

Authors: 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

Recommendations

• The chaos game on a general iterated function system
• A chaos game algorithm for generalized iterated function systems
• Chaos game for IFSs on topological spaces
• The chaos game on a general iterated function system from a topological point of view
• "Chaos Games" for Iterated Function Systems with Grey Level Maps

zbMATH Keywords

iterated function systemchaos gamefractalIFS attractor

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Recurrent iterated function systems
• An ergodic theorem for iterated maps
• Title not available (Why is that?)
• A classical ergodic property for IFS: a simple proof

Cited In (6)

• A NEW EXAMPLE OF A DETERMINISTIC CHAOS GAME
• The generalized Sierpiński problem
• Fractal formation in the circular chaos game: a topological investigation
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659841)