Abstract
We saw the chaos game in Chapter 2, where it was introduced first as a means of generating an image of the attractor of an IFS in R2. In this chapter, we will see several other things one can do with the chaos game. First we will modify the chaos game to obtain a way of generating approximations of the invariant function for an IFSM (see Chapter 3 for the basic properties and results about an IFS on functions). Our modification is inspired by work of Berger [21, 22, 23], who constructed a chaos game for generating the graph of a wavelet.
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Kunze, H., Torre, D.L., Mendivil, F., Vrscay, E.R. (2012). The Chaos Game. In: Fractal-Based Methods in Analysis. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-1891-7_6
Download citation
DOI: https://doi.org/10.1007/978-1-4614-1891-7_6
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-1890-0
Online ISBN: 978-1-4614-1891-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)