Proves that typical drivers in the chaos game for iterated function systems yield convergence rates comparable to any ψ→∞ and can be arbitrarily slow.
Martyn,The chaos game revisited:Yet another, but a trivial proof of the algorithm’s correctness, Appl
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A non-logarithmic approach to the rate of convergence of the deterministic chaos game
Proves that typical drivers in the chaos game for iterated function systems yield convergence rates comparable to any ψ→∞ and can be arbitrarily slow.