arXiv · 1005.0322
The Chaos Game on a General Iterated Function System
Abstract
The main theorem of this paper establishes conditions under which the "chaos game" algorithm almost surely yields the attractor of an iterated function system. The theorem holds in a very general setting, even for non contractive iterated function systems, and under weaker conditions on the random orbit of the chaos game than obtained previously.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Michael Barnsley, Andrew Vince. 2010-05-03. The Chaos Game on a General Iterated Function System. https://arxiv.org/abs/1005.0322
Cite the original work for its findings. Save a collection to share your selection of sources.