At the resolution of the monitor a clean picture of

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: and deterministic IFS algorithms. Given an infinite sequence I = (i1 i2 · · · ) with each ij ∈ {1, 2, . . . , n}, the forward orbit of (x0 , y0 ) determined by I is OI + (x0 , y0 ) = {(x0 , y0 ), Ti1 (x0 , y0 ), Ti2 Ti1 (x0 , y0 ), . . . } is an implementation of the random IFS algorithm. Theorem 2.4.1 and Cor. 2.4.2 show that all forward orbits have the same closure, and that is the attractor of the IFS. Theorem 2.4.1 The closure of the orbit generated by the any implementation of the random IFS is the attractor of the corresponding deterministic IFS; that is, A is the closure of Σ. As an illustration of Theorem 2.4.1, Fig. 2.25 shows three images of the gasket produced by the random algorithm. In the left and middle pictures the three transformations are applied equally frequently. That is, the probability of applying each Ti is 1/3. In the right side of Fig. 2.25 the probabilities have been modified: T1 and T2 have been applied with probability 1/5, and T3 with 2.4. CONVERGENCE OF RANDOM IFS 55 probability...
View Full Document

Ask a homework question - tutors are online