Abstract
Our idea of randomness, especially with regard to images, is that structures or patterns which are created randomly look more or less arbitrary. Maybe there is some characteristic structure, but if so, it is probably not very interesting — like a box of nails poured out onto a table.
Nothing in Nature is random... A thing appears random only through the incompleteness of our knowledge.
Spinoza
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference
The discovery was made by the botanist Robert Brown around 1827.
M. F. Barnsley, Fractal modelling of real world images in: The Science of Fractal Images, H.-O. Peitgen and D. Saupe
This was first observed by Gerald S. Goodman, see G. S. Goodman, A probabilist looks at the chaos game, in: Fractals in the Fundamental and Applied Sciences, H.-O. Peitgen, J. M. Henriques, L. F. Peneda (eds.), North-Holland, Amsterdam, 1991.
J. Hutchinson, Fractals and self-similarity, Indiana University Journal of Mathematics 30 (1981) 713–747.
This procedure was suggested among other pseudo-random number generators by Ian Stewart, Order within the chaos game? Dynamics Newsletter 3, Nos. 2 and 3, May 1989, 4–9. Stewart ends his article: `I have no idea why these results are occurring […] Can these phenomena be explained? […]’ Our arguments will give some first insight. They were worked out by our students E. Lange and B. Sucker in a semester project of an introductory course on fractal geometry.
t is important to do the histogram computation using double precision calculations. Otherwise it is very likely, that the iteration for the logistic equation will run into a periodic cycle of a low period (perhaps even less than 1000), and, as a consequence a histogram based on such an orbit would be a numerical artifact. This effect and the topic of histograms will be continued in chapter 10.
This experiment approximates the so-called natural measure of the quadratic iterator. See chapter 10 for more details.
For an introduction into the topic of random number generation see D. E. Knuth The Art of Computer Programming, Volume 2, Seminumerical Algorithms, Second Edition, Addison-Wesley, Reading, Massachusetts, 1981.
Details have appeared in the paper Rendering methods for iterated function systems by D. Hepting, P. Prusinkiewicz and D. Saupe, in: Fractals in the Fundamental and Applied Sciences,H.-O. Peitgen, J. M. Henriques, L. F. Peneda (eds.), North-Holland, Amsterdam, 1991.
See S. Dubuc and A. Elqortobi, Approximations of fractal sets, Journal of Computational and Applied Mathematics 29 (1990) 79–89.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Peitgen, HO., Jürgens, H., Saupe, D. (1992). The Chaos Game: How Randomness Creates Deterministic Shapes. In: Chaos and Fractals. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4740-9_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4740-9_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-4742-3
Online ISBN: 978-1-4757-4740-9
eBook Packages: Springer Book Archive