Presentation on theme: "Chaos Game Exploration of Triple Vertex Polygons John Paul, Thomas, Bjorn GUTS/Challenge STI 2009."— Presentation transcript:
Chaos Game Exploration of Triple Vertex Polygons John Paul, Thomas, Bjorn GUTS/Challenge STI 2009
Chaos Game Method of describing a fractal pattern OR attractor of an iterated function set. Agents hop around randomly on the surface, instead of traditional methods of testing to see whether each iterated function is a part of the fractal (i.e. cutting). Coined by Michael Barnsley.
The Math Starting with any point x 0, successive iterations are formed as x k+1 = f r (x k ). Where f r is a member of the given IFS randomly selected for each iteration. The iterations converge to the fixed point of the iterated function series. Whenever x 0 belongs to the attractor of the IFS, all iterations x k stay inside the attractor and.