LOGO
Presentation
On
By
FRACTALS Group 9
LOGO
Amit Pawar (38)
Rehan Dawt (08)
Bharat Joshi(20)
Group
Members
Omkar Naik (59) Ashish Karkera (58)
[Link]
LOGO
AGENDA
1 Introduction to Fractals
2 Hilbert’s Curve
3 Koch Curve
4 Fractal Using Computer
5 Fractal Lines
6 Fractal Surfaces [Link]
LOGO
Some Fractals
1 2 3
. .
[Link]
LOGO
Need of fractal geometry
Euclidean geometry methods are adequate for
describing manufactured object :those have
smooth surfaces and regular shapes.
But natural objects, such as mountains and
clouds, have irregular or fragmented features,
and euclidean methods do not realistically
model this objects.
Hence To describe natural objects fractal
method is used.
LOGO Fractals
Typically are used to model objects with the
properties that they are:
Irregular
Randomly jagged, but constrained
On zooming in, the shape becomes more
irregular
On zooming out, the shape becomes less
irregular
LOGO
LOGO
Fractal Topological Dimension
• Measure for the detail of a fractal object.
Object deformed into line or line segment
dimension Dt = 1
Object deformed into plane
dimension Dt = 2
Object deformed into cube
dimension Dt = 3
We call Dt topological dimension
LOGO
Measure of objects dimension
Line segment
Take a line segment of length L & divide it into N
identical pieces, each of length l=L/N,
scaled by a factor 1/s.
To assemble the original line segment from the segment
scaled by 1/s,
N=s1
LOGO
Square
If scaled down to 1/s, we get small square.
If we rebuild to original , in case of s=2, it takes 4
squares & for s=3 it takes 9 squares.
In general
N=s2
Cube
If we scale by 1/s, number of small cubes to assemble
large cube is
N=s3
LOGO
We can generalize as,
N= sD
Therefore dimension D is,
D= log N / log s
LOGO
Hilbert’s Curve
Ashish Karkera (58)
LOGO
Hilbert’s Curve
The curve can be build by
the following successive
approximation.
Begin with square.
The first approximation will
to divided the square into 4
quadrants and draw the
curve which connects the
center points of each.
LOGO
The second approximation will be to further
subdivide each of the quadrants
Connects the centers of these finer division
before moving to the next major quadrant.
LOGO
The third approximation subdivides again. It
again connects the center of the finest level
of detail.
LOGO
Now we can imagine continuing this process
indefinitely. What will the final result look like?
For one thing, the curve is arbitrarily close to
every point in the square.
The curve passes through the point on a grid,
which becomes twice as fine with each sub
division,& there is no limit to the subdivisions.
LOGO
LOGO
The curve fills the square.
One more fact is that the length of the curve is
infinite with each subdivision the length
increases by factor of 4.
since we imagine no limit to the subdivisions
there is also no limit to the length.
LOGO
So we have constructed a curve which is
topologically equivalent to a to a line Dt = 1,
but the curve has been so twisted and folded
that it exactly fills up a square.
LOGO
We can find the fractal dimension of the curve
at each sub division the scale changes by
2,but the length changes by 4.
It takes 4 curves of half scale to build the full
sized object, so dimension D given by
4=2D
must be D=2 the curve has topological
dimension 1 but fractal dimension 2. it is a
line so folded that it behave like two
dimensional object
LOGO
Koch Curve
Amit Pawar (38)
LOGO
Geometric Construction of
Self- Similar Fractals
To geometrically
construct a deterministic
(nonrandom) self-similar
fractal, we start with a
given geometric shape,
called the Initiator Koch Initiator
Subparts of the initiator
are then replaced with a
pattern called the
Generator
Koch Generator
LOGO
Koch Curve
The Koch snowflake (or Koch star) is a mathematical
curve and one of the earliest fractal curves to have been
described.
In mathematics, the concept of a curve tries to capture
the intuitive idea of a geometrical one-dimensional and
continuous object. Example:- circle.
In everyday use of the term "curve", a straight line is not
curved, but in mathematical terms curves include
straight lines and line segments.
It is created by starting with a line segment, then
recursively altering each line segment.
LOGO
Koch Curve
The altering process is done as follows:
divide the line segment into three segments of equal
length.
draw an equilateral triangle that has the middle
segment from step 1 as its base and points outward.
remove the line segment that is the base of the
triangle from step 2
LOGO Koch
LOGO
Koch Curve
Each line segment in the initiator is replaced with four
equal-length line segments at each step
On reducing the scale by 3, we get a curve that looks
just like the original
But 4 such curves must be assembled to make the
original
Hence,
4=3D
Solving this for the Fractal Dimension,
D = log34 = log 4 / log 3 = 1.2648
LOGO
Koch Curve
Each time the initiator (a line segment in the figure) is
replaced with the generator, there are four times as
many line segments
The length of each line segment is one-third the
length of the segments in the previous stage
LOGO
Koch Curve
The length of each segment in the initiator increases by
a factor of 4/3 at each step
The definition of the curve requires that the process of
replacement be repeated forever
Hence the length of the curve tends to infinity as more
detail is added to the curve
LOGO
Koch Curve
The Koch Curve after seven iterations would
like this:
LOGO
Koch Curve
At level k, the length is (4/3)k so in the limit, the
length of the curve approaches infinity.
LOGO
Fractal using Computer
Omkar Naik (59)
LOGO
Fractal Using Computer
•The computer can be use to generate
self-similar fractal curve
•It can be done by self-referencing procedure
i.e. recursive procedure
LOGO
•Consider the curve composed of N self-
similar
pieces, each scaled by 1/s
•The curve can be drawn by a routine which
calls
itself N times with arguments scaled by 1/s
LOGO
A computer routine should terminate, where
as the true fractal does not
In computer routine, each recursive call has
smaller argument i.e. smaller length
At one point the length become smaller than
the size of pixel
The computer procedure can terminate
at this point
LOGO
By using the computer user can generate
realistic coastlines or mountain peaks etc
This can be done without concern for all
the small bends and wiggles
The user only need to give the endpoints
LOGO
LOGO
FRACTAL GENERATED GRAPHICS
One of the values generated in the iteration is
used to produce a height, and, consequently a
rugged terrain.
LOGO
Generated by string productions.
LOGO
Fractal Lines
Bharat Joshi (20)
LOGO
Fractal Lines
A fractal line
LOGO
Line Drawing (self-similar curve)
Fractal Line drawing ……
Halfway point :
for straight line (x1,y1,z1) to (x2,y2,z2)
halfway point is midpoint
((x1+x2 / 2), (y1+y1 / 2), (z1+z2 / 2))
LOGO
Line Drawing (self-similar curve)
For fractal line,
halfway point will be offset a little from that :
(add offset term to each coordinate)
((x1+x2 / 2) + dx, (y1+y1 / 2) + dy ,
(z1+z2 / 2) + dz)
LOGO
Line Drawing (self-similar curve)
Offset is to get random effect
Offset is calculated as :
dx = L * W * GAUSS
L : length of segment
W : weighting function
(curve roughness & fractal dimension)
GAUSS : returns Gaussian variable with 0 mean
LOGO
Line Drawing (self-similar curve)
Offset calculation says :
halfway point for fractal line differs
from ideal midpoint by laws of chance
Scale factor says :
how strongly the line tends to deviate
LOGO
Line Drawing (self-similar curve)
To get fractal line or to bend it further
recursively apply this method to find halfway
points for each segment until segment
becomes to small to matter
LOGO
Line Drawing (self-similar curve)
Offset the halfway point
Results in fractal curve, two pieces (N = 2)
Each piece similar to original, having a length
averaging a bit greater than half of original
Dimension a bit greater than 1
Greater the W : the rougher the curve
Greater the length : smaller the s
LOGO
Fractal Line Drawing Algorithm
Algorithm FRACTAL-LINE-ABS-3(X,Y,Z,W,N,FSEED)
User routine for drawing fractal line
Arguments X,Y,Z point to which to draw the line
W describes the roughness of the curve
N desired depth of recursion
FSEED seed for fractal pattern
Global DF- PEN-x,DF-PEN-Y,DF-PEN-Z current pen posn
SEED seed used by the rabdom number generator
Local L the approximate line length
LOGO
Fractal Surface
Ways to extend fractal idea into surface:
Based on Triangles
Imagine each edge of the triangle as fractal line
Connect halfway points with line segments, i.e. 4
triangles
Subdivide each one as per requirement!
LOGO
LOGO
LOGO
LOGO
H:\unix\cg\[Link]
LOGO
