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

From MaRDI portal
Revision as of 19:00, 3 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    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

    Identifiers