I was fascinated by the detail in this picture and decided to look up how iterated function systems work. An IFSs essentially involves the iteration of one of more affine transformations. Each affine transformation is called an attractor, and the compilation of multiple attractors (ie. several affine transformations) allows us to create complex shapes. Here's a website explaining the basic ideas of IFS: http://www.stsci.edu/~lbradley/seminar/ifs.html
Also a look at this great website with another explanation of IFSs and examples such as the Serpinski triangle: http://ecademy.agnesscott.edu/~lriddle/ifs/ifs.htm
This is a really interesting way to reformulate your thinking about recursive problems as well! If you took 106B you probably generated some fractals using basic recursion, however with IFS we can do the same thing with transformations!
I was fascinated by the detail in this picture and decided to look up how iterated function systems work. An IFSs essentially involves the iteration of one of more affine transformations. Each affine transformation is called an attractor, and the compilation of multiple attractors (ie. several affine transformations) allows us to create complex shapes. Here's a website explaining the basic ideas of IFS: http://www.stsci.edu/~lbradley/seminar/ifs.html
Also a look at this great website with another explanation of IFSs and examples such as the Serpinski triangle: http://ecademy.agnesscott.edu/~lriddle/ifs/ifs.htm
This is a really interesting way to reformulate your thinking about recursive problems as well! If you took 106B you probably generated some fractals using basic recursion, however with IFS we can do the same thing with transformations!