Chaos Game Exploration of Triple Vertex Polygons John Paul, Thomas, Bjorn GUTS/Challenge STI 2009.
-
Upload
luis-russell -
Category
Documents
-
view
215 -
download
0
Transcript of Chaos Game Exploration of Triple Vertex Polygons John Paul, Thomas, Bjorn GUTS/Challenge STI 2009.
![Page 1: Chaos Game Exploration of Triple Vertex Polygons John Paul, Thomas, Bjorn GUTS/Challenge STI 2009.](https://reader036.fdocuments.us/reader036/viewer/2022062511/55159e3d55034674578b5e4f/html5/thumbnails/1.jpg)
Chaos Game Exploration of Triple Vertex Polygons
John Paul, Thomas, BjornGUTS/Challenge STI 2009
![Page 2: Chaos Game Exploration of Triple Vertex Polygons John Paul, Thomas, Bjorn GUTS/Challenge STI 2009.](https://reader036.fdocuments.us/reader036/viewer/2022062511/55159e3d55034674578b5e4f/html5/thumbnails/2.jpg)
Chaos Game
Method of describing a fractal patternOR 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.
![Page 3: Chaos Game Exploration of Triple Vertex Polygons John Paul, Thomas, Bjorn GUTS/Challenge STI 2009.](https://reader036.fdocuments.us/reader036/viewer/2022062511/55159e3d55034674578b5e4f/html5/thumbnails/3.jpg)
The Math
Starting with any point x0, successive iterations are formed as xk+1 = fr(xk).
Where fr 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 x0 belongs to the attractor of the IFS, all iterations xk stay inside the attractor and.
![Page 4: Chaos Game Exploration of Triple Vertex Polygons John Paul, Thomas, Bjorn GUTS/Challenge STI 2009.](https://reader036.fdocuments.us/reader036/viewer/2022062511/55159e3d55034674578b5e4f/html5/thumbnails/4.jpg)
![Page 5: Chaos Game Exploration of Triple Vertex Polygons John Paul, Thomas, Bjorn GUTS/Challenge STI 2009.](https://reader036.fdocuments.us/reader036/viewer/2022062511/55159e3d55034674578b5e4f/html5/thumbnails/5.jpg)
![Page 6: Chaos Game Exploration of Triple Vertex Polygons John Paul, Thomas, Bjorn GUTS/Challenge STI 2009.](https://reader036.fdocuments.us/reader036/viewer/2022062511/55159e3d55034674578b5e4f/html5/thumbnails/6.jpg)
The Model
Start with original Serpinski Chaos Game code (written by Nick Bennett)
What happens when we vary the factor? I.E. Instead of ½, how about .23 or .75?
![Page 7: Chaos Game Exploration of Triple Vertex Polygons John Paul, Thomas, Bjorn GUTS/Challenge STI 2009.](https://reader036.fdocuments.us/reader036/viewer/2022062511/55159e3d55034674578b5e4f/html5/thumbnails/7.jpg)
Results
![Page 8: Chaos Game Exploration of Triple Vertex Polygons John Paul, Thomas, Bjorn GUTS/Challenge STI 2009.](https://reader036.fdocuments.us/reader036/viewer/2022062511/55159e3d55034674578b5e4f/html5/thumbnails/8.jpg)
http://en.wikipedia.org/wiki/File:Sierpinski_pyramid.png
![Page 9: Chaos Game Exploration of Triple Vertex Polygons John Paul, Thomas, Bjorn GUTS/Challenge STI 2009.](https://reader036.fdocuments.us/reader036/viewer/2022062511/55159e3d55034674578b5e4f/html5/thumbnails/9.jpg)
http://en.wikipedia.org/wiki/File:Sierpi%C5%84ski_Pyramid_from_Above.PNG
![Page 10: Chaos Game Exploration of Triple Vertex Polygons John Paul, Thomas, Bjorn GUTS/Challenge STI 2009.](https://reader036.fdocuments.us/reader036/viewer/2022062511/55159e3d55034674578b5e4f/html5/thumbnails/10.jpg)
Results Cont’d
![Page 11: Chaos Game Exploration of Triple Vertex Polygons John Paul, Thomas, Bjorn GUTS/Challenge STI 2009.](https://reader036.fdocuments.us/reader036/viewer/2022062511/55159e3d55034674578b5e4f/html5/thumbnails/11.jpg)
Expanding the Model/Project
Pull the mathematics out of the equation:
Jonathan Wolfe, HELP ME!
![Page 12: Chaos Game Exploration of Triple Vertex Polygons John Paul, Thomas, Bjorn GUTS/Challenge STI 2009.](https://reader036.fdocuments.us/reader036/viewer/2022062511/55159e3d55034674578b5e4f/html5/thumbnails/12.jpg)
References
Wikipedia!
http://en.wikipedia.org/wiki/Chaos_game
http://en.wikipedia.org/wiki/Sierpinski_triangle
Bennett, N. NetLogo Mystery Model.