Recursion, Fractals

RECURSION,
FRACTALS
Team 8
FAF-212
ZAICA MAIA POPESCU NICHIFOR

MANOLE ANDREEA DOBROJAN
CRUCERESCU VLAD ALEXANDRU
BOTEZATU MARIUS
1.RECURSION
Recursion is an important concept in computer science.

When a function calls itself, it is called a recursive function,
the process of defining something in terms of itself.
Real life examples

This method of solving a
problem is generally used
when the solution depends on
solutions to smaller instances
of the same problem.
2)fractals
the term fractal was coined by

the mathematician Mandelbrot
in 1975. In his seminal work
“The Fractal Geometry of
Nature,” he defines a fractal as
“a rough or fragmented
geometric shape that can be
split into parts, each of which is
a reduced-size copy of the
whole.”
Let’s consider a tree branching structure
the shape of this

branch resembles
the tree itself
AKA “self-
similarity”
Let’s consider a tree branching structure
Notice that:
● The above tree is
perfectly symmetrical
● The parts are, in fact,
exact replicas of the
whole.
Fractals do not have to be perfectly self-similar.
Let’s take a look

at a graph of the
stock market
Graphs of stock market data are

examples of fractals because they look
the same at any scale. Are these graphs
of the stock over one year? One day?
One hour? There’s no way for you to
know without a label.
This is an example of a stochastic

fractal, meaning that it is built out of
probabilities and randomness. Unlike
the deterministic tree-branching
structure, it is statistically self-
similar.
a line is self-similar.
LINES A line looks the same at
any scale,
AREN’ and can be thought of as

comprising lots of little
lines.
T Fractals are characterized
by having a fine structure
FRACT
at small scales and cannot
be described with
Euclidean geometry. :)
ALS
3)cantor set (w
recursive function)
The Cantor rule tells us to erase
the middle third of that line, which
leaves us with two lines, one from the
beginning of the line to the one-third
mark, and one from the two-thirds
mark to the end of the line.
The Koch curve
The Koth curve is a method named after a Swedish mathematician Helge von Koch
and invented in 1904 that creates a fractal pattern, here are the rules:
Koth
snowflake
The Koch curve and other fractal patterns are often called “mathematical
monsters.” This is due to an odd paradox that emerges when you apply the recursive
definition an infinite number of times. If the length of the original starting line is one,
the first iteration of the Koch curve will yield a line of length four-thirds (each
segment is one-third the length of the starting line). Do it again and you get a length
of sixteen-ninths. As you iterate towards infinity, the length of the Koch curve
approaches infinity. Yet it fits in the tiny finite space provided right here on this paper
(or screen)!
An animated representation of Koch curve
5. Trees
As fractals are one of nature biggest design secrets. One of

the most familiar example of self similarity is a tree, if we
look at each of the nodes, we’ll actually see the pattern of
branching is very similar throughout the tree.
Trees are perfect examples of fractals in nature. You will find fractals at every
level of the forest ecosystem from seeds and pinecones, to branches and
leaves, and to the self-similar replication of trees, ferns, and plants
throughout the ecosystem.
So how do we draw a fractal tree. The algorithm is as follows:
● We draw the trunk of the tree.

● At the end point of that trunk, we rotate to some degree and draw a
branch.
● Then we need to comeback to the origin location of the branch, or the
end point of the previous branch.
● We rotate and draw the same branch again.
The Sierpiński triangle also
called the Sierpiński gasket, is a
fractal attractive fixed set with
the overall shape of an
equilateral triangle, subdivided
recursively into smaller
equilateral triangles. Originally
constructed as a curve, this is
one of the basic examples of self-
similar sets—that is, it is a
mathematically generated
pattern that is reproducible at A Sierpinski gasket can
any magnification or reduction. It be generated by a fractal
is named after the Polish tree.
mathematician Wacław
Sierpiński, but appeared as a
6)The MANDELBROT SET
venus saturn
Yes! Saturn is
the ringed
one
02 03 04 05 06
earth jupiter pluto

Earth is Jupiter is the Pluto is
where we all biggest considered a
live on planet of dwarf planet
them all
http://davidbau.com/mandelbrot/
Fractals Application
•Fractal antennas
•Computer Graphics
•Medical Research
•Computer and video game design
•Architecture
•Fractal transistor
•Digital imaging
Thank you
for your attention

Recursion, Fractals

Uploaded by

Copyright:

Available Formats

Recursion, Fractals

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Recursion, Fractals

Uploaded by

Copyright:

Available Formats

RECURSION,

ZAICA MAIA POPESCU NICHIFOR

Recursion is an important concept in computer science.

Real life examples

the term fractal was coined by

the shape of this

Let’s take a look

Graphs of stock market data are

This is an example of a stochastic

AREN’ and can be thought of as

As fractals are one of nature biggest design secrets. One of

So how do we draw a fractal tree. The algorithm is as follows:

● We draw the trunk of the tree.

earth jupiter pluto

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.