The chaos game revisited: Yet another, but a trivial proof of the algorithm's correctness (Q659841): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4040874 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An ergodic theorem for iterated maps / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A classical ergodic property for IFS: a simple proof / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4458322 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recurrent iterated function systems / rank | |||
Normal rank | |||
Latest revision as of 20:25, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The chaos game revisited: Yet another, but a trivial proof of the algorithm's correctness |
scientific article |
Statements
The chaos game revisited: Yet another, but a trivial proof of the algorithm's correctness (English)
0 references
24 January 2012
0 references
The author provides an elementary proof, i.e., based only on fundamentals of probability, for the correctness of the most popular algorithm to approximate IFS (iterated function system) fractals, the chaos game.
0 references
fractal
0 references
iterated function system
0 references
IFS attractor
0 references
chaos game
0 references
