The chaos game revisited: Yet another, but a trivial proof of the algorithm's correctness (Q659841)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The chaos game revisited: Yet another, but a trivial proof of the algorithm's correctness |
scientific article; zbMATH DE number 5999948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The chaos game revisited: Yet another, but a trivial proof of the algorithm's correctness |
scientific article; zbMATH DE number 5999948 |
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
0.8119515776634216
0 references
0.7735826969146729
0 references
0.7729601263999939
0 references
0.7652779221534729
0 references
0.7595245838165283
0 references
