DOCSLIB.ORG

Mandelbrot Sets  Julia and Fatou Sets  Mandelbulbs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Mandelbrot Sets  Julia and Fatou Sets  Mandelbulbs Fractals - the ultimate art of mathematics Adam Kozak Outline What is fractal? Self-similarity dimension Fractal types Iteration Function Systems (IFS) L-systems Introduction to complex numbers Mandelbrot sets Julia and Fatou sets Mandelbulbs 2 What is fractal? Why should I pay attention to it? Geometric object with property of self-similarity in any scale factor – in exact manner, approximate or stochastic Similarity dimension may be not equal to topologic dimension (non-integer value) Relatively simple recursive definitions Applications: Fractal compression Fractal art Ideas in engineering, electronics, chemistry, medicine, urban planning which have self-similarity patterns Fractal antenna in mobile phones capable of capturing much wider scope of frequencies in much smaller areas than classic antenna 3 Fractals in nature Romanesco broccoli Fern Wikipedia : High voltage breakdown within a 4″ block of acrylic Source Coast with rivers 4 Kolmogorov complexity Everyting what can be described, can be described as a string of characters over any alphabet of size > 1. E.g. infinite string Ala ma kota, Ala ma kota, Ala ma kota,… To encode such a string literally we would need infinite memory, however… we know that we can recreate its any finite substring simply using a computer THIS STRING IS COMPUTABLE Kolmogorov complexity of a finite string is a length of the shortest computer program which recreates the string (this is an uncomputable function – there is no algorithm to evaluate it!) Kolmogorov(„Ala ma kota, Ala ma kota, Ala ma kota, Ala ma kota, Ala ma kota, …”) = Length(„while (true) print(’Ala ma kota, ’);”) It is also called informational complexity 5 Hausdorff similarity dimension Similarity dimension may be not equal to topologic dimension (non-integer value) For „normal” geometric object if we scale it by factor (0<<1), we need 1 d copies of this object to fill the area of original object where d is dimension d log N N 1 d lim 0 log1 1 2n , N 3n log 3n log 3 d lim 1,58496... n log 2n log 2 6 Fractal types Fractals may be obtained from different concepts: . Atractors of Iterated Function Systems (IFS) . Julia & Fatou sets . Mandelbrot sets . L-system (Lindenmayer system) 7 Contracting mapping Let (X, d) be a metric space, then f: X X is a contracting mapping if: 0,1:a1,a2 X : d f (a1), f (a2 ) da1,a2 Banach fixed point theorem: There exists exactly one point pX such, that f(p)=p (fixed point of contracting mapping) Recursive execution of contracting mapping: f(x,y)=(x/3,y/3) xn1 f xn lim xn x x f x cos10 coscos 10 coscoscos 10 n 8 Iterated Function Systems (IFS) Recursive transformations of geometric object which sum product of a set of n affine contracting mappings (compositions of rotation, reflection, translation and contracting scaling): {Fi : X X } (1i n) n S0 S Sk Fi Sk 1 S lim Sk k i1 S is any non empty set of points in a given space X S is a fractal – an attractor of IFS, it’s independent of initial S (S is a fixed point of set of contracting mappings {Fi} in metric space (H, h) where H is set of all compact subsets of X and h is Hausdorff distance) 9 Iterated Function Systems (IFS) 2 Any affine contracting mapping Fi in space has the following formula: x' ax by c x' x cosx sin y x tx Fi x, y y' dx ey f y' y sin x cos y y t y 1 x 1 1 y 1 y 1 x 2 x 1 y 4 x y 30 tx 0 t y 2 10 An example of IFS – Sierpiński triangle 2 2 IFS: {Fi: } (i=1..3): F3x, y x y 0 1 21 0x 1 4 F1x, y 1 20 1y 0 1 21 0x 1 4 F2 x, y 1 20 1y 0 1 21 0x 0 F3 x, y 1 20 1y 3 4 F2 x, y F1x, y Sierpiński triangle is a fixed point (attractor) of Iterated Function System {F1, F2 , F3} 11 IFS – workshop Task: locate, count and define contractig mappings Sierpiński triangle in 3D space (pyramid) Sierpiński carpet [src: Wikipedia] [src: Wikipedia] Barnsley fern with some clues ;) [src: Wikipedia] 12 L-system (Lindenmayer system) L-systems are based on recursive grammar with defined variables, constants, rules, axiom and generating parameters; we can assign some operations to each symbol eg.: . variables : X F . constants : + − [ ] . axiom: X . rules : (X → F-[[X]+X]+F[+FX]-X), (F → FF) . parameter - angle: 25° Assigned meaning of symbols for above L-system: ( F ) draw forward ( - ) turn left 25° ( + ) turn right 25° ( X ) does nothing, just controls evolution of the curve ( [ ) saves coordinates and angle on stack (push) ( ] ) recovers coordinates and angle from stack (pop) Exemplary generator: http://www.kevs3d.co.uk/dev/lsystems/# 13 Quick introdution to complex numbers There is no a real number x such, that 풙2 = −ퟏ Ok, so let’s create a number which is two-dimensional, and put such a number on imaginary axis, let’s call it 퐢 Complex plane Imaginary numbers 1+i i Real numbers -1 1 -i Let’s preserve addition and multiplication like for real numbers keeping in mind, that 풊2 = −ퟏ: 풂 + 풃풊 + 풄 + 풅풊 = 풂 + 풄 + 풃 + 풅 풊 풂 + 풃풊 풄 + 풅풊 = 풂풄 + 풂풅 + 풃풄 풊 + 풃풅풊ퟐ = 풂풄 − 풃풅 + 풂풅 + 풃풄 풊 14 Quick introdution to complex numbers But there is another representation! Complex plane Imaginary numbers 1 + 푖 = 푟 푐표푠 + 푖푠푖푛 = 2 푐표푠45 + 푖푠푖푛45 i 2 2 = 2 + 푖 r 2 2 Real numbers -1 1 -i Now applying the rules for trygonometric functions we see that multiplication is actually related to rotation on a plane! Complex plane is a field. 풂 + 풃풊 풄 + 풅풊 = 푟1 푐표푠1 + 푖푠푖푛1 푟2 푐표푠2 + 푖푠푖푛2 = 푟1푟2 cos(1 + 2) + 푖푠푖푛(1 + 2) 15 Riemann sphere Let’s map whole complex plane onto a spehere, where infility corresponds to a noth pole 16 Mandelbrot sets 1. Mandelbrot sets are defined for rational functions over closed set of complex numbers C C {z*} (z* corresponds to infinity) cC c a bi where i2 1 2. Rational function W :C C is a division of two polynomials: k k1 w(z) ak z ak1z a1z a0 W (z) m m1 l(z) bm z bm1z b1z b0 3. Let Wc denote a rational function dependent on parameter cC n n1 4. Let Wc (z) Wc Wc (z) 5. Mandelbrot set M(Wc) of a rational function Wc is a set of such n points cC that Wc (0) is not convergent to z*: n M Wc {cC : lim Wc (0) z*} n 17 Mandelbrot sets This may be satisfied in two ways: . Recursion is convergent to some point c0 n lim Wc (0) c0 where c0 C n c c Orbit of point c 0 . Recursion finally falls into a cycle (number of stable cycles is related to degree of W) Orbit of pointn c M Wc {cC : lim Wc (0) z*} n 18 Mandelbrot set - example The first and best known Mandelbrot set was defined for polynomial function n 2 Wc (z) z c Thus we need to check for each point in cC if sequence c, c2+c, (c2+c)2+c2+c, … goes to infinity or not Workshop: Check, if point c=0+i belongs to Mandelbrot set for this function 1 2 Wc (0) 0 i i 2 2 Wc (0) i i i 1 3 2 Wc (0) i 1 i 1 2i 1 i i 4 2 Wc (0) i i 1 i i 1 Orbit of point c of pointOrbit ..... 19 Mandelbrot set journey http://www.youtube.com/watch?v=9G6uO7ZHtK8 20 Does Mandelbrot set exist? Take a look „visual” complexity very low Kolmogorov complexity of its image for (int y = 0; y < HEIGHT; y++) { for (int x = 0; x < WIDTH; x++) { double zx = zy = 0; double cX = (x - WIDTH/2) / ZOOM; double cY = (y - HEIGHT/2) / ZOOM; for (int it = MAX_ITER; zx * zx + zy * zy < 4 && it > 0; it--) { tmp = zx * zx - zy * zy + cX; zy = 2.0 * zx * zy + cY; zx = tmp; } image[x][y] = color(it); } } 21 Newton method for finding function root https://commons.wikimedia.org/wiki/File:NewtonIteration_Ani.gif f (xn ) xn1 xn f '(xn ) 22 Julia and Fatou sets Are based on the same rational functions as Mandelbrot sets and are strictly related to them (Julia set is connected for parameters belonging to Mandelbrot set). Fatou sets are areas in C which are attracted by some points (here colors red, blue and green) for rational function W(z) Julia set is a ,,border’’ between Fatou set areas which is attracted by infinity point (z*). 02k i 3 3 3 n f (z) z 1 z 1 zk0,1,2 1e z0 1, z1 1 i 3 2, z2 1 i 3 2, f (z) z3 1 W (z) z z 2z z 2 3 f '(z) 3z 2 W(z) 2z z2 3 Here is Julia/Fatou set for function W(z) obtained from Newton’s method for function f(z) = z3-1. Thus attracting points for Wn(z) correspond to roots of f(z). http://www.youtube.com/watch?v=nczm0jdyWps Green color is attracting basin of z0, red of z1, and blue of z2. 23 Mandelbulbs – Mandelbrot sets in 3D Defined by Daniel White and Paul Nylander using double rotation transformation for spherical coordinates, since there is no 3D equivalence to 2D complex numbers having all properties of field http://www.youtube.com/watch?v=rEhWtQfx5nw 24 Thank you for attention References: T.
Load more

Recommended publications
  • Fractals and the Chaos Game
    University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-2006 Fractals and the Chaos Game Stacie Lefler University of Nebraska-Lincoln Follow this and additional works at: https://digitalcommons.unl.edu/mathmidexppap Part of the Science and Mathematics Education Commons Lefler, Stacie, "Fractals and the Chaos Game" (2006). MAT Exam Expository Papers. 24. https://digitalcommons.unl.edu/mathmidexppap/24 This Article is brought to you for free and open access by the Math in the Middle Institute Partnership at DigitalCommons@University of Nebraska - Lincoln. It has been accepted for inclusion in MAT Exam Expository Papers by an authorized administrator of DigitalCommons@University of Nebraska - Lincoln. Fractals and the Chaos Game Expository Paper Stacie Lefler In partial fulfillment of the requirements for the Master of Arts in Teaching with a Specialization in the Teaching of Middle Level Mathematics in the Department of Mathematics. David Fowler, Advisor July 2006 Lefler – MAT Expository Paper - 1 1 Fractals and the Chaos Game A. Fractal History The idea of fractals is relatively new, but their roots date back to 19 th century mathematics. A fractal is a mathematically generated pattern that is reproducible at any magnification or reduction and the reproduction looks just like the original, or at least has a similar structure. Georg Cantor (1845-1918) founded set theory and introduced the concept of infinite numbers with his discovery of cardinal numbers. He gave examples of subsets of the real line with unusual properties. These Cantor sets are now recognized as fractals, with the most famous being the Cantor Square .
    [Show full text]
  • Linear Algebra Linear Algebra and Fractal Structures MA 242 (Spring 2013) – Affine Transformations, the Barnsley Fern, Instructor: M
    Linear Algebra Linear Algebra and fractal structures MA 242 (Spring 2013) – Affine transformations, the Barnsley fern, Instructor: M. Chirilus-Bruckner Charnia and the early evolution of life – A fractal (fractus Latin for broken, uneven) is an object or quantity that displays self-similarity, i.e., for which any suitably chosen part is similar in shape to a given larger or smaller part when magnified or reduced to the same size. The object need not exhibit exactly the same structure at all scales, but the same ”type” of structures must appear on all scales. sources: http://mathworld.wolfram.com/Fractal.html and http://www.merriam-webster.com/dictionary/fractal The Barnsley fern is an example of a fractal that is cre- ated by an iterated function system, in which a point (the seed or pre-image) is repeatedly transformed by using one of four transformation functions. A random process de- termines which transformation function is used at each step. The final image emerges as the iterations continue. The transformations are affine transformations T1,...,T4 of the form x Tj (x,y)= Aj + vj y where Aj is a 2 × 2 -matrix and vj is a vector. An affine transformation is any transformation that preserves collinearity (i.e., all points lying on a line initially still lie on a line after transformation) and ratios of distances (e.g., the midpoint of a line segment remains the midpoint after transformation). In general, an affine transformation is a composition of rotations, translations, dilations, and shears. While an affine transformation preserves proportions on lines, it does not necessarily preserve angles or lengths.
    [Show full text]
  • Julia Fractals in Postscript Fractal Geometry II
    Kees van der Laan EUROTEX 2012 & 6CM PROCEEDINGS 47 Julia fractals in PostScript Fractal Geometry II In memory of Hans Lauwerier Abstract Lauwerier’s BASIC codes for visualization of the usual Julia fractals: JULIAMC, JULIABS, JULIAF, JULIAD, JULIAP, of the Mandelbrot fractal MANDELx, MANDIS, MANDET and his codes for the advanced circular symmetric Julia fractals JULIAS, JULIASYMm, JULIASYM, FRACSYMm, as well as the classical 1D bifurcation picture Collet, have been converted into PostScript defs. Examples of use are included. A glimpse into Chaos theory, in order to understand the principles and peculiarities underlying Julia sets, is given. Bifurcation diagrams of the Ver- hulst model of limited growth and of the Julia quadratic dynamical system — M-fractal — have been included. Barnsley’s triples: fractal, IFS and equivalent dynamical system are in- troduced. How to use the beginnings of colours in PostScript is explained. How to obtain Julia fractals via Stuif’s Julia fractal viewer, and via the special fractal packages Winfract, XaoS, and Fractalus is dealt with. From BASIC codes to PostScript library defs entails soft- ware engineering skills. The paper exhibits experimental fractal geometry, practical use of minimal TEX, as well as ample EPSF programming, and is the result of my next step in ac- quainting myself with Lauwerier’s 10+ years work on fractals. Keywords Acrobat Pro, Adobe, art, attractor, backtracking, Barnsley, BASIC, bifurcation, Cauchy con- vergence, chaos, circle symmetry, dynamical systems, EPSF, escape-time algorithm, Feigen- baum constant, fractal dimension D, Fractalus package, FIFO, fractal geometry, IDE (Inte- grated development Environment), IFS (Iterated Function System), Julia, Lauwerier, Man- delbrot, mathematical software, minimal encapsulated PostScript, minimal plain TeX, Monte Carlo, μ-geometry, periodic doubling, Photoshop, PSlib, PSView, repeller, self-similarity, software engineering, Stuif’s previewer, TEXworks, (adaptable) user space, Verhulst growth model, Winfract package, XaoS fractal package.
    [Show full text]
  • Fractals and the Collage Theorem
    University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-2006 Fractals and the Collage Theorem Sandra S. Snyder University of Nebraska-Lincoln Follow this and additional works at: https://digitalcommons.unl.edu/mathmidexppap Part of the Science and Mathematics Education Commons Snyder, Sandra S., "Fractals and the Collage Theorem" (2006). MAT Exam Expository Papers. 49. https://digitalcommons.unl.edu/mathmidexppap/49 This Article is brought to you for free and open access by the Math in the Middle Institute Partnership at DigitalCommons@University of Nebraska - Lincoln. It has been accepted for inclusion in MAT Exam Expository Papers by an authorized administrator of DigitalCommons@University of Nebraska - Lincoln. Fractals and the Collage Theorem Expository Paper Sandra S. Snyder In partial fulfillment of the requirements for the Master of Arts in Teaching with a Specialization in the Teaching of Middle Level Mathematics in the Department of Mathematics. David Fowler, Advisor. July 2006 Snyder – MAT Expository Paper - 1 Fractals and the Collage Theorem 1 A. Fractal History The idea of fractals is relatively new, but their roots date back to 19 th century mathematics. A fractal is a mathematically generated pattern that is reproducible at any magnification or reduction and the reproduction looks just like the original, or at least has a similar structure. Georg Cantor (1845-1918) founded set theory and introduced the concept of infinite numbers with his discovery of cardinal numbers. He gave examples of subsets of the real line with unusual properties. These Cantor sets are now recognized as fractals, with the most famous being the Cantor Square.
    [Show full text]
  • Modelling Vegetation Through Fractal Geometry
    Modelling Vegetation Through Fractal Geometry Irina Tolkova Spring Quarter 2014 Contents 1 Introduction 1 2 Preliminary Material 2 3 Iterated Function Systems 3 3.1 Contraction Mappings . 3 3.2 Iterated Function Systems . 5 3.3 The Collage Theorem . 7 4 Applications of Iterated Function Systems 8 4.1 The Algorithm . 9 4.2 Barnsley's Fern . 10 4.3 Fractal Tree . 10 A Implementing the IFS Algorithm 10 1 Introduction Most natural structures { plants, forests, mountains, landscapes { provide a stark contrast to shapes in Euclidean geometry. This causes a problem for modeling: the exactness of mathematics seems to be inadequate for capturing the complexity and apparent stochastic quality of real-life surround- ings. However, in the 1960s, Benoit B. Mandelbroit proposed the idea of fractal geometry, which is fundamentally fragmented and nowhere smooth. In his book "The Fractal Geometry of Nature", he discussed the applications of fractal geometry (in his words, the "geometry of nature"), especially for their use in studying the natural world. [4] In his book Fractal Geometry, Kenneth Falconer avoids giving a precise definition of a fractal, writing "it seems best to regard a fractal as a set that has properties as those listed below, rather than look for a precise definition which will almost certainly exclude interesting some cases" [3, pg xx]. The properties of the set S he referenced are as follows: 1. S has a structure that is detailed on arbitrarily small scales 2. S is self-similar in some way; either directly, statistically, or approximately 1 3. S cannot be described by traditional geometric shapes due to its irregular structure While Mandelbrot gave a more formal definition of a fractal through the Hausdorff dimension of a set, the term "fractal" will be used informally throughout the paper to refer to sets with properties like those described by Falconer.
    [Show full text]
  • Fractals, Self-Similarity and Hausdorff Dimension
    Undergraduate Colloquium: Fractals, Self-similarity and Hausdorff Dimension Andrejs Treibergs University of Utah Wednesday, August 31, 2016 2. USAC Lecture on Fractals The URL for these Beamer Slides: \Fractals: self similar fractional dimensional sets" http://www.math.utah.edu/~treiberg/FractalSlides.pdf 3. References Michael Barnsley, \Lecture Notes on Iterated Function Systems," in Robert Devaney and Linda Keen, eds., Chaos and Fractals, Proc. Symp. 39, Amer. Math. Soc., Providence, 1989, 127{144. Gerald Edgar, Classics on Fractals, Westview Press, Studies in Nonlinearity, Boulder, 2004. Jenny Harrison, \An Introduction to Fractals," in Robert Devaney and Linda Keen, eds., Chaos and Fractals, Proc. Symp. 39, Amer. Math. Soc., Providence, 1989, 107{126. Yakov Pesin & Vaughn Climengha, Lectures on Fractal Geometry and Dynamical Systems, American Mathematical Society, Student Mathematical Library 52, Providence, 2009. R. Clark Robinson, An Introduction to Dynamical Systems: Continuous and Discrete, Pearson Prentice Hall, Upper Saddle River, 2004. Shlomo Sternberg, Dynamical Systems, Dover, Mineola, 2010. 4. Outline. Fractals Middle Thirds Cantor Set Example Attractor of Iterated Function System Cantor Set as Attractor of Iterated Function System. Contraction Maps Complete Metric Space of Compact Sets with Hausdorff Distance Hutchnson's Theorem on Attractors of Contracting IFS Examples: Unequal Scaling Cantor Set, Sierpinski Gasket, von Koch Snowflake, Barnsley Fern, Minkowski Curve, Peano Curve, L´evy Dragon Hausdorff Measure and Dimension Dimension of Cantor Set by Covering by Intervals Similarity Dimension Similarity Dimension of Cantor Set Similarity Dimension for IFS of Similarity Transformations Moran's Theorem Similarity Dimensions of Examples Kiesswetter's IFS Construction of Nowhere Differentiable Function 5. Fractal. Cantor Set. A fractal is a set with fractional dimension.
    [Show full text]
  • TOPICS on ENVIRONMENTAL and PHYSICAL GEODESY Compiled By
    TOPICS ON ENVIRONMENTAL AND PHYSICAL GEODESY Compiled by Jose M. Redondo Dept. Fisica Aplicada UPC, Barcelona Tech. November 2014 Contents 1 Vector calculus identities 1 1.1 Operator notations ........................................... 1 1.1.1 Gradient ............................................ 1 1.1.2 Divergence .......................................... 1 1.1.3 Curl .............................................. 1 1.1.4 Laplacian ........................................... 1 1.1.5 Special notations ....................................... 1 1.2 Properties ............................................... 2 1.2.1 Distributive properties .................................... 2 1.2.2 Product rule for the gradient ................................. 2 1.2.3 Product of a scalar and a vector ................................ 2 1.2.4 Quotient rule ......................................... 2 1.2.5 Chain rule ........................................... 2 1.2.6 Vector dot product ...................................... 2 1.2.7 Vector cross product ..................................... 2 1.3 Second derivatives ........................................... 2 1.3.1 Curl of the gradient ...................................... 2 1.3.2 Divergence of the curl ..................................... 2 1.3.3 Divergence of the gradient .................................. 2 1.3.4 Curl of the curl ........................................ 3 1.4 Summary of important identities ................................... 3 1.4.1 Addition and multiplication .................................
    [Show full text]
  • Fractal Simulation of Plants
    Degree project Fractal simulation of plants Author: Haoke Liao Supervisor: Hans Frisk Examiner: Marcus Nilsson Date: 2020-01-29 Course Code: 2MA41E Subject: Mathematics Level: Bachelor Department Of Mathematics Abstract We study two methods of simulation of plants in R2, the Lindenmayer system and the iterated function system. The algorithm for a L-system simulates fast and efficiently the growth structure of the plants. The iterated function system can be done by deterministic iteration or by the so called chaos game. 2 Contents 1 Introduction 4 1.1 History . .5 2 L-systems 5 3 Iterated Function Systems 9 3.1 Deterministic Iteration . 10 3.2 Chaos Games . 13 4 Concluding remarks 16 3 1 Introduction Simulation of complex plant structures in nature is a popular field of com- puter graphics research [9]. In this thesis, we take the Lindenmayer systems (L- system for short) and the iterated function systems (IFS for short) as the main methods in R2. We choose Chaos and fractals [1] and The algorithmic beauty of plants [3] as the key books and study how L-system and IFS work for the frac- tals. The figures of the plants are created by Mathematica [4]. The plants can be regarded a generalization of the classical fractals. Let us introduce the fractals through 2 concepts, self similarity and Hausdorff di- mension. The objects of the classical fractals research are usually not smooth and they have an irregular geometry. A closed and bounded subset of the Eu- clidean plane R2 is said to be self-similar if it can be expressed in the form S = S1 [ S2 [···[ Sk where S1, S2 ··· , Sk are non-overlapping sets, each of which is similar to S scaled by the same factor s (0 < s < 1) [5].
    [Show full text]
  • Fractals Everywhere”
    SELF-SIMILARITY IN IMAGING, 20 YEARS AFTER “FRACTALS EVERYWHERE” Mehran Ebrahimi and Edward R.Vrscay Department of Applied Mathematics Faculty of Mathematics, University of Waterloo Waterloo, Ontario, Canada N2L 3G1 [email protected], [email protected] ABSTRACT In this paper, we outline the evolution of the idea of Self-similarity has played an important role in mathemat- self-similarity from Mandelbrot’s “generators” to Iterated ics and some areas of science, most notably physics. We Function Systems and fractal image coding. We then briefly briefly examine how it has become an important idea in examine the use of fractal-based methods for tasks other imaging, with reference to fractal image coding and, more than image compression, e.g., denoising and superresolu- recently, other methods that rely on the local self-similarity tion. Finally, we examine some extensions and variations of images. These include the more recent nonlocal meth- of nonlocal image processing that are inspired by fractal- ods of image processing. based coding. 1. INTRODUCTION 2. FROM SELF-SIMILARITY TO FRACTAL IMAGE CODING Since the appearance of B. Mandelbrot’s classic work, The Fractal Geometry of Nature [28], the idea of self- 2.1. Some history similarity has played a very important role in mathematics and physics. In the late-1980’s, M. Barnsley of Georgia In The Fractal Geometry of Nature, B. Mandelbrotshowed Tech, with coworkers and students, showed that sets of how “fractal” sets could be viewed as limits of iterative contractive maps with associated probabilities, called “It- schemes involving generators. In the simplest case, a gen- erated Function Systems” (IFS), could be used not only erator G acts on a set S (for example, a line segment) to to generate fractal sets and measures but also to approxi- produce N finely-contracted copies of S and then arranges mate natural objects and images.
    [Show full text]
  • Fractals and Art
    Project Number: 48-MH-0223 FRACTALS AND ART An Interactive Qualifying Project Report Submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE in partial fulfillment of the requirements for the Degree of Bachelor of Science by Steven J. Conte and John F. Waymouth IV Date: April 29, 2003 Approved: 1. Fractals 2. Art Professor Mayer Humi, Advisor 3. Computer Art Abstract Fractals are mathematically defined objects with self-similar detail on every level of magnification. In the past, scientists have studied their mathematical properties by rendering them on computers. Re- cently, artists have discovered the possibilities of rendering fractals in beautiful ways in order to create works of art. This project pro- vides some background on several kinds of fractals, explains how they are rendered, and shows that fractal art is a newly emerging artistic paradigm. 1 Contents 1 Executive Summary 5 2 Introduction 6 2.1 Fractals .............................. 7 3 Are Fractals Art? 9 4 The Mandelbrot and Julia Sets 12 4.1 The Mandelbrot Set ....................... 12 4.1.1 Definition ......................... 12 4.1.2 Mandelbrot Image Generation Algorithm ........ 13 4.1.3 Adding Color ....................... 15 4.1.4 Other Rendering Methods ................ 18 4.2 The Julia Set ........................... 18 4.3 Self-Similarity of the Mandelbrot and Julia Sets ........ 19 4.4 Higher Exponents ......................... 20 4.5 Beauty and Art in the Mandelbrot and Julia Sets ....... 21 4.5.1 Finding interesting fractal images ............ 22 4.5.2 Deep zooming ....................... 23 4.5.3 Coloring techniques .................... 25 4.5.4 Layering .......................... 26 5 Iterated Function Systems 28 5.1 Affine Transformations .....................
    [Show full text]
  • Quiz Which Mathematician Has first Described the Middle Third Cantor Set? A) Smith B) Cantor C) Weierstrass D) Mandelbrot
    E-320: Teaching Math with a Historical Perspective Oliver Knill, 2013 Problem 5 Lecture 10: Quiz Which mathematician has first described the middle third Cantor set? a) Smith b) Cantor c) Weierstrass d) Mandelbrot Name: Problem 6 Problem 1 What is the name of the three dimensional Mandelbrot set? a) Mandelbar b) 3D Mandelbrot Which fractal is displayed in the picture? c) Mandelbulb d) The Euler bulb. a) The Barnsley fern b) The tree of Pythagoras c) The Douady rabbit d) Sierpinsky carpet Problem 2 Problem 7 What is the dimension of the Cantor middle set? a) 2/3 b) log(2/3) c) log(2)/ log(3) d) log(3)/ log(2). What is the Mandelbrot set? a) The set of z for which the orbit of T (z)= z2 + c diverges. b) The set of c for which the orbit of T (z)= z2 + c starting with z = 0 diverges. 2 Problem 3 c) The set of z for which the orbit of T (z)= z + c stays bounded. d) The set of c for which the orbit of T (z)= z2 + c starting with z = 0 stays bounded. What is a fractal? a) A geometric fractured into several pieces. b) A set of fractions. Problem 8 c) A set with cardinality between the integers and reals. d) A set with non-integer dimension. The higher dimensional analog of the Mandelbrot set is also of the form T (z)= zn + c. What is multiplied by a factor n? a) The Euler Angles. b) The radius c) The area.
    [Show full text]
  • Accelerated Rendering of Fractal Flames
    Accelerated rendering of fractal flames Michael Semeniuk, Mahew Znoj, Nicolas Mejia, and Steven Robertson December 7, 2011 1 Executive Summary 1.1 Description ........................................... 1 1.2 Significance ........................................... 1 1.3 Motivation ........................................... 1 1.4 Goals and Objectives ...................................... 2 1.5 Research ............................................. 2 2 Fractal Background 2.1 Purpose of Section ........................................ 3 2.2 Origins: Euclidean Geometry vs. Fractal Geometry ....................... 4 2.3 Fractal Geometry and Its Properties .............................. 4 2.4 Fractal Types .......................................... 8 2.5 Visual Appeal .......................................... 10 2.6 Limitations of Classical Fractal Algorithms ........................... 11 3 The Fractal Flame Algorithm 3.1 Section Outline ......................................... 13 3.2 Iterated Function System Primer ................................ 13 3.3 Fractal Flame Algorithm .................................... 22 3.4 Filtering ............................................. 29 4 Existing implementations 4.1 flam3 .............................................. 33 4.2 Apophysis ............................................ 33 4.3 flam4 .............................................. 34 4.4 Fractron 9000 .......................................... 34 4.5 Chaotica ............................................. 34 4.6 Our implementation .....................................
    [Show full text]