Fractals Week 10, Lecture 19

Size: px

Start display at page:

Download "Fractals Week 10, Lecture 19"

Sheila West
5 years ago
Views:

CS 430/536 Computer Graphics I Fractals Week 0, Lecture 9 David Breen, William Regli and Maim Peysakhov Geometric and Intelligent

$edu Overview Fractal representations Algorithms for drawing fractals Mandelbrot Set Brownian Motion 994$ $Self-similarity (small portion looks like the whole object ) Have fractional dimensions Non-differentiable Infinite length Length of the$ coastlines are infinite in length?

1 CS 430/536 Computer Graphics I Fractals Week 0, Lecture 9 David Breen, William Regli and Maim Peysakhov Geometric and Intelligent Computing Laboratory Department of Computer Science Dreel University Overview Fractal representations Algorithms for drawing fractals Mandelbrot Set Brownian Motion 994 Foley/VanDam/Finer/Huges/Phillips ICG Introduction to Fractals Term Fractal coined by Benoit Mandelbrot Properties of fractal: Self-similarity (small portion looks like the whole object ) Have fractional dimensions Non-differentiable Infinite length Length of the Fractals Lewis Richardson (96) measured length of coastlines Total length increase as measurement stick reduced Does this mean coastlines are infinite in length? Construction of Koch Curve 3 4 Koch Curve Properties of Koch Curve Has no tangent at any point Length of the curve at iteration n is (4/3) n Step Num of segments Length of segment Total length *0 60 Koch curve is.686 dimensional object * *

2 Fractal Dimensions D line of unit length divided into n segments looks like the whole line scaled by /n D square of unit area divided into n segments looks like the whole square scaled by /n / i.e. 4 segments, each one / the size of the original Divide an object into n segments where each segment is scaled by /s s = n /d d = log(n)/log(s) = log(4)/log() The square is divided into 4 parts and each part is / the size of the original d = log(4)/log() = Fractal Dimensions s = n /d d = log(n)/log(s) Koch curve divides line into 4 parts, each part is /3 the size of the original Therefore the dimension of the Koch curve is: 4 d = 3, n/ d = s d = log(4) log(3) = log(n) = log(s) 7 8 Space Filling Fractals Sierpinski Triangle Peano curve (890) Fills a D region Fractal dimension - s = n /d 9 segments /3 original size = log(9)/log(3) Construction of Peano Curve Naturally Occurring Fractals Fractals often occur in nature All natural fractals are grown We can model natural objects with fractals Production Systems In 968 A. Lindenmayer developed a formalism describing plant growth. Called L-system L-system consists of: Seed cell (aiom) Production rules Brain Lungs Kidney Aiom: B Rules: B=>F[-B][+B] F=>FF 3

3 Plantlike Fractals Plantlike Fractals 4 5 Plantlike Fractals 3 Affine Transformation Fractals Fractal often described to contain miniature versions of itself. We can use affine transformations to describe where these miniatures should be placed Translation Rotation Scaling Self-affine fractals may have different scaling factors in different dimensions 6 7 Multiple Reduction Copy Machine Algorithm Can be simulated with real copy machine Copy machine takes a seed image Creates several transformed copies of it as an output. Procedure is recursive MRCM Eamples 8 9 3

Problems with MRCM Iterated Functional System To get good image

eponentially with depth Problem amplified when the reduction in

$transformation L i (p) to point p Converges to a fractal Fern$ Leaf 0 500 points 5000 points IFS Algorithm IFS Generated Tree

affine transformations Transform the point Continue recursively

comple number c For some c, 0 as n c Mandelbrot Set For some c,

(n= to n ma ) { n = n +c if ( n >) break Mandelbrot Set } If (n <

4 Problems with MRCM Iterated Functional System To get good image we must compute MRCM to large depth Computing time grows eponentially with depth Problem amplified when the reduction in size during one iteration is small Observations: Fractal consist entirely of points Randomly and recursively apply affine transformation L i (p) to point p Converges to a fractal Fern Leaf points 5000 points IFS Algorithm IFS Generated Tree Pick random point of the seed image Randomly pick one of the affine transformations Transform the point Continue recursively Fern Leaf 3 Mandelbrot Set Mandelbrot Set n = n- +c for some comple number c For some c, 0 as n c Mandelbrot Set For some c, as n For others neither For each c in the comple plane 0 =0 for (n= to n ma ) { n = n +c if ( n >) break Mandelbrot Set } If (n < n ma ) color c = white else color c = black 4 5 Magnified region from 4

Mandelbrot Set Newton Set f() = 3 - n+ = n - f() / f'() 6 Recorded with XaoS 7

The dance of pollen grains in a water drop (Robert Brown in 87) Eplained by Albert

mountains and other random natural phenomena 8 9 Recorded with XaoS Fractional

Integral on progress of random walk fbm characterized by it s power spectrum BM

0 Think of β as controlling terrain roughness XMOUNTAINS Landscape generated by

5 Mandelbrot Set Newton Set f() = 3 - n+ = n - f() / f'() 6 Recorded with XaoS 7 Recorded with XaoS Phoeni Set z n + = z n + Re(c) + Im(c) * z n - Brownian Motion The dance of pollen grains in a water drop (Robert Brown in 87) Eplained by Albert Einstein in 905 Self-similar motion Infinite length Used to simulate rivers mountains and other random natural phenomena 8 9 Recorded with XaoS Fractional Brownian Motion Fractional BM (fbm) is a generalization of BM to include memory Integral on progress of random walk fbm characterized by it s power spectrum BM has /f power spectrum fbm had /f β power spectrum with.0 β 3.0 Think of β as controlling terrain roughness XMOUNTAINS Landscape generated by the XMOUNTAINS program by Steven Booth Realistic, self-similar image 30 Voss & Saupe in The Science of Fractal images 3 5

XMOUNTAINS: Changing Fractal Dimension Random Midpoint Displacement fbm computations are time consuming RMD are faster to compute but less

Compute the midpoint for each interval Displace the midpoint at random but based on the difference between end points 3 34 Michael Shantz @

() s - is a surface roughness y(b) parameter y(a) r g ()- returns a Gaussian random value a (mean = 0, variance = ) In 3D version: y m =

placement of peaks and valleys We can do it by setting up Control Surfaces.

6 XMOUNTAINS: Changing Fractal Dimension Random Midpoint Displacement fbm computations are time consuming RMD are faster to compute but less realistic Basic idea: Start with (D) 4 (3D) random points. Compute the midpoint for each interval Displace the midpoint at random but based on the difference between end points 3 34 Michael University of Waterloo RMD Algorithm Controlling the Topography Generate points a and b at random y mid = (/)(y(a)+y(b))+r y r = s ( b-a ) r g () s - is a surface roughness y(b) parameter y(a) r g ()- returns a Gaussian random value a (mean = 0, variance = ) In 3D version: y m = (/4)(y(a)+y(b)+y(c)+y(d))+r b y a b d c y y(b) y(a) y mid a a+b b y a e b h d g m f c To model real environments we want to control the placement of peaks and valleys We can do it by setting up Control Surfaces. Calculate random elevations based on: Elevation of control surface Average elevation of the midpoint Fractal Mountains Ken Musgrave Cellular Automata 37 Invented by John von Neumann in 940s Thoroughly studied by Wolfram Mechanism to study reproduction Dynamic system Discrete in space Discrete in time 38 6

7 Cellular Automata in Nature Conus Tetile Seashell Process which creates seashells has been linked to a one-dimensional CA 39 Source: wikipedia.org 40 7

CGT 581 G Procedural Methods Fractals

CGT 581 G Procedural Methods Fractals Bedrich Benes, Ph.D. Purdue University Department of Computer Graphics Technology Procedural Techniques Model is generated by a piece of code. Model is not represented