fractals

16

Upload: celina

Post on 05-Jan-2016

22 views

Category:

Documents


0 download

DESCRIPTION

Fractals. Benoît Mandelbrot, “father of fractal geometry”. Jennifer Trinh. They’re SO BADASS!. I’m badass too!. Basic Idea. Fractals are Self-similar (will go into details in a moment) Cannot be described accurately with Euclidean geometry (they’re complex) - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Fractals
Page 2: Fractals

FractalsJennifer Trinh

Benoît Mandelbrot, “father of fractal geometry”

Page 3: Fractals

They’re SO BADASS!

I’m badass

too!

Page 4: Fractals

Basic Idea

Fractals are

•Self-similar (will go into details in a moment)

•Cannot be described accurately with Euclidean geometry (they’re complex)

•Have a higher Hausdorff-Besicovitch dimension than topological dimension (will go into details in a moment)

•Have infinite length or detailRomanesco

Broccoli

Page 5: Fractals

With Euclidean geometry…

Page 6: Fractals

Exact Self-Similarity: Koch Snowflake

Can be formed with L-systems

Page 7: Fractals

Approximate Self-Similarity: Mandelbrot Set

Page 8: Fractals

Statistical Self-Similarity

Page 9: Fractals

Hausdorff-Besicovitch Dimension: Fractal Dimension?

• relationship between the measured length and the ruler length is not linear, i.e.: 1 dimensional

• The fractal/Hausdorff-Besicovitch dimension is d in the equation N = M^d, where N is the number of pieces left after an object is divided M times.  E.g., we divide the sides of a square into thirds, we have 9 total pieces left.  9 = 3^2, so the fractal dimension is 2.

• More formally seen as log(N(l)) = log(c) - D log(l)• Doesn’t have to be an integer

Sierpinski Triangle

Page 10: Fractals

Generating Fractals•“Escape-time fractals:•Escape-time fractals: give each point a value and

plug into a recursive function (Mandelbrot set consists of complex numbers such that x(n+1)=x(n)^2 + c does not go to infinity, like i; they remain bounded). Depending on what a value does, that point gets a certain color, causes fractal picture

•Iterated function systems: fixed geometric replacement

•Random fractals: determined by stochastic processes (place a seed somewhere. Allow a particle to randomly travel until it hits the seed, then start a new randomly placed particle; see here)

Page 11: Fractals

“Measuring” Fractals•Smaller and smaller rulers

•Box methods: counting the number of non-overlapping boxes or cubes (went over in Kenkel)

•See Kenkel

•Lacunarity: measuring how much space a fractal takes up (kind of like density). Another way to classify

Page 12: Fractals

Sources

• http://tiger.towson.edu/~gstiff1/fractalpage.htm• http://www.fractal-animation.net/ufvp.html• http://local.wasp.uwa.edu.au/~pbourke/fractals/• http://www.fractalus.com/info/layman.htm• http://en.wikipedia.org/wiki/Fractal• http://mathworld.wolfram.com/

KochSnowflake.html

Page 13: Fractals
Page 14: Fractals
Page 15: Fractals
Page 16: Fractals