6. The Mandelbrot Set

Size: px
Start display at page:

Download "6. The Mandelbrot Set"

Transcription

1 1 The Mandelbrot Set King of mathematical monsters Im Re Christoph Traxler Fractals-Mandelbrot 1 Christoph Traxler Fractals-Mandelbrot 2 6.1

2 Christoph Traxler Fractals-Mandelbrot 3 Christoph Traxler Fractals-Mandelbrot 4 6.2

3 Christoph Traxler Fractals-Mandelbrot 5 Ordering the Julia Sets J c For each c of f c = z 2 +c there exists a particular Julia set J c The set of all Julia sets is uncountable infinite How can J c be classified with respect to c? Christoph Traxler Fractals-Mandelbrot 6 6.3

4 Ordering the Julia Sets Jc Mandelbrot s idea (1979): Create a map of the complex plane, which shows information about the Julia sets for each complex number c What is the classification criterion? Christoph Traxler Fractals-Mandelbrot 7 Ordering the Julia Sets J c Dichotomy of Julia sets: Julia sets can be seperated into two categories: J c is connected J c is totally disconnected (Cantor dust) Christoph Traxler Fractals-Mandelbrot 8 6.4

5 Ordering the Julia Sets J c Visualize the area of points for which the corresponding Julia set is connected Def.: The set M = {c C J c is a connected set } is called Mandelbrot set Fact: J c is connected if and only if the critical orbit 0 c c 2 +c... is bounded Christoph Traxler Fractals-Mandelbrot 9 Critical Point of J c Def.: If f c (z) = 0, then z is called critical point f c (z) = 2z z = 0 is the critical point for any J c The orbit of the critical point z=0 is called critical orbit If and only if the critical orbit escapes to then J c is Cantor dust Christoph Traxler Fractals-Mandelbrot

6 Calculating the Map Calculate the fate of the critical point z = 0 Iterate z z 2 +c, z 0 = 0 The orbit is not bounded and escapes to if z > 2 J c is totally disconnected c M Approximation of M with the pixel game, accuracy depends on the number of iterations Visualization of the equipotentials of A( ) Christoph Traxler Fractals-Mandelbrot 11 Calculating the Map The pixel game algorithm for M: for(i=0; i<height; i++) for(j=0; j<width; j++) { c = point4pixel(i,j); for(n=0,z=0; n<=nmax; n++) { if(rad(z)> 2) 2) break; z = z*z + c; c; } if(n > NMAX) setpixel(i,j,black); else setpixel(i,j,getcol(n)); } Christoph Traxler Fractals-Mandelbrot

7 Difference between J c and M Julia set f c (z) = z 2 + c c is a constant z is variable examine the orbit z f c (z) f c2 (z)... for each point z Mandelbrot set f(z) = z 2 + c c is variable z 0 = 0 is constant examine the orbit 0 f(0) f 2 (0)... for each c Christoph Traxler Fractals-Mandelbrot 13 Zoom Sequence Christoph Traxler Fractals-Mandelbrot

8 Zoom Sequence Christoph Traxler Fractals-Mandelbrot 15 Zoom Sequence Christoph Traxler Fractals-Mandelbrot

9 Zoom Sequence Christoph Traxler Fractals-Mandelbrot 17 Calculating the Map Faster Divide & conquer approach Quadtree subdivision of the complex plane Calculate the points on the edges of the grid and on the diagonals of each rectangle If all points of a rectangle and of its diagonal have the same value n, then no further subdivision is necessary Subdivision is also terminated if the rectangles are smaller then a pixel Christoph Traxler Fractals-Mandelbrot

10 Calculating the Map Faster Christoph Traxler Fractals-Mandelbrot 19 Encirclement of J c Approximation of J c with deformed discs Start with a disc S r that surrounds J c and calculate the sequence: S k = { z f c (z) S k-1 },with S 0 = S r This sequence of nested deformed discs converges to J c The deformed discs correspond to equipotential curves of A( ) Christoph Traxler Fractals-Mandelbrot

11 Encirclement of J c One of the following conditions is true: A)The whole sequence S n, n, consits of Jordan curves (disc like shapes) B) S 0,...,S k are Jordan curves but not the rest of the sequence S k+1,... Christoph Traxler Fractals-Mandelbrot 21 Encirclement of J c If S k is a Jordan curve, then there are 3 possible cases for S k+1 : 1) S k+1 is also a Jordan curve and the critical point 0 and point c are in the interior of S k+1, condition A is true 0 S k+1 Christoph Traxler Fractals-Mandelbrot

12 S k+1 0 S k+1 0 Encirclement of J c 2) S k+1 is made up of B Jordan curves, which touch exactly at the critical point, condition B is true 3) S k+1 is made up of two disjoint Jordan curves and does not contain the critical point, condition B is true Christoph Traxler Fractals-Mandelbrot 23 Encirclement of J c If condition A is true, then K c contains the critical point and c (their orbits don t escape to ) J c is connected If condition B is true, then K c neither contains the critical point nor c (their orbits escape to ) J c is disconnected Christoph Traxler Fractals-Mandelbrot

13 Encirclement of J c S r S r c S k c S k K c K c Condition A is true Condition B is true Christoph Traxler Fractals-Mandelbrot 25 Aquivalent Definitions of M The Mandelbrot set M can be defined in various ways: M = { c C J c is connected } = { c C c K c } = { c C critical point 0 K c } = { c C critical point 0 A( ) } = { c C f n (c) 2 n = 0,1,2,... } Christoph Traxler Fractals-Mandelbrot

14 Level Sets The encirclement of J c is a decomposition of A( ) into subsets of points which converge to with the same speed These subsets are called level sets Each area of attraction of a periodic point can be decomposed in this way Level sets visualize the behaviour of points under iteration in an area of attraction Christoph Traxler Fractals-Mandelbrot 27 Level Sets Decomposition of an attraction area A(p) of an attractive periodic point p into a level set: Choose a target set T which contains p The level of each point z C is defined as: l c (z) = k, if f ci (z) T, i<k, and f ck (z) T l c (z) = 0, else Level set L k = { z l c (z) = k }, k is the convergence speed of z Christoph Traxler Fractals-Mandelbrot

15 Level Sets Examples: Julia set, Mandelbrot set, p =, T = { z z 1/ε }, ε very small Christoph Traxler Fractals-Mandelbrot 29 Level Sets Target set T arbitrary, for example: {c,z 2 }, A(0) is the unit circle, decomposition of A(0) with T = K c, c M Christoph Traxler Fractals-Mandelbrot

16 Level Sets Level sets as height fields Christoph Traxler Fractals-Mandelbrot 31 Level Sets Level sets as height fields Christoph Traxler Fractals-Mandelbrot

17 Level Sets Level sets as height fields Christoph Traxler Fractals-Mandelbrot 33 Binary Decomposition Extension of the level set method Subdivision of the target set into 2 parts induces a subdivision of the level L k into 2 k+1 parts Iteration of f c (z), z = r(cosϕ + isinϕ) doubles the angle ϕ a loop of a closed curve in L k corresponds to 2 k+1 loops in T The borders of the subdivided parts are good approximations of field lines Christoph Traxler Fractals-Mandelbrot

18 Binary Decomposition For each point z L k : Draw a black point if 0 angle(f ck (z)) π Draw a white point else T ϕ L1 ϕ T L 1 Christoph Traxler Fractals-Mandelbrot 35 Binary Decomposition Christoph Traxler Fractals-Mandelbrot

19 Binary Decomposition Christoph Traxler Fractals-Mandelbrot 37 Properties of M M is connected M contains infinite many copies of itself These copies are connected with the main body by strings The fractal dimension of M is 2 M is a table of content for all connected Julia sets J c Christoph Traxler Fractals-Mandelbrot

20 Properties of M Christoph Traxler Fractals-Mandelbrot 39 Components of M Cardioid - heart shaped region Buds - circle like shapes connected to the cardioid or other buds Two components are connected by only one point, called seed point Copies of M Buds correspond to Julia sets that bound the area of attraction of a periodic point with a specific period Christoph Traxler Fractals-Mandelbrot

21 4 Components of M buds 2 seed points largest copy of M 3 5 cardioid Numbers indicate the period of the periodic point of the corr. J c Christoph Traxler Fractals-Mandelbrot 41 Classes of J c with Respect to M If c is a point of the cardioid then J c is a Jordan curve with a fixpoint (period = 1) P Christoph Traxler Fractals-Mandelbrot

22 Classes of J c with Respect to M If c is a seed point then P is an indifferent periodic point P Christoph Traxler Fractals-Mandelbrot 43 Classes of J c with Respect to M If c lies on the border of M and is no seed point then P is an indifferent periodic point in the Siegel disc Siegel disc P Points of K c rotate on the Siegel disc arround P Christoph Traxler Fractals-Mandelbrot

23 Classes of J c with Respect to M If c lies on a connecting string then is the only fixpoint of J c, K c = J c This class of Julia sets is called dendrites Christoph Traxler Fractals-Mandelbrot 45 Classes of J c with Respect to M If c lies in a copy of M then J c is a combination of the J c1 of the connecting string and the J c2 of the main body where c 2 has the same relative position in the main body Christoph Traxler Fractals-Mandelbrot

24 Classes of J c with Respect to M If c lies outside of M then J c is totally disconnected (Cantor dust), the density of the points decreases with increasing distance to M Christoph Traxler Fractals-Mandelbrot 47 Similarity Relation M has a similar structure in the environment of c as the corresponding J c when magnified at the same position Christoph Traxler Fractals-Mandelbrot

25 Structural Stability of M Example: {C, r c } r c = ((z 2 +c-1) / (2z+c-2 )) 2 r c describes magnetic phase transitions Attractive fixpoints: 1, Examine the orbit 0 r c (c) r 2 c (c)... for all c and draw a map What does M there? Christoph Traxler Fractals-Mandelbrot 49 Structural Stability of M Answer: r c has a local behaviour like f c =z 2 +c M is universal, - it can be discovered in several dynamic systems Given {C, f p }, f arbitrary, p C the map of the parameter space contains a (maybe deformed) copy of M with high probability Christoph Traxler Fractals-Mandelbrot

26 Structural Stability of M Christoph Traxler Fractals-Mandelbrot

On Fractal Colouring Algorithms

On Fractal Colouring Algorithms 5 10 July 2004, Antalya, Turkey Dynamical Systems and Applications, Proceedings, pp. 706 711 On Fractal Colouring Algorithms Nergiz Yaz Department of Mathematics, Faculty of Sciences Ankara University,

More information

Images of Julia sets that you can trust

Images of Julia sets that you can trust Images of Julia sets that you can trust Luiz Henrique de Figueiredo with Diego Nehab (IMPA) Jorge Stolfi (UNICAMP) João Batista Oliveira (PUCRS) Can we trust this beautiful image? Curtis McMullen Julia

More information

Escape-Time Fractals

Escape-Time Fractals Escape-Time Fractals Main Concept Fractals are geometric shapes that exhibit self-similarity. That is, they have the same pattern at different scales. In fact, fractals continue to show intricate details

More information

Fractal Dimension of Julia Sets

Fractal Dimension of Julia Sets Fractal Dimension of Julia Sets Claude Heiland-Allen claude@mathr.co.uk March 6, 2015 Fractal Dimension of Julia Sets Fractal Dimension How Long is a Coast? Box-Counting Dimension Examples Fractal Dimension

More information

A Generalized Mandelbrot Set Based On Distance Ratio

A Generalized Mandelbrot Set Based On Distance Ratio A Generalized Mandelbrot Set Based On Distance Ratio Xizhe Zhang College of Computer Science and Technology, Jilin University No.2699, Qianjin street 3002, Changchun, Jilin, China zxzok@63.com Tianyang

More information

31) More about Quartics

31) More about Quartics 31) More about Quartics (Before reading this doubble article, I strongly recommend a repetition of Article18) In this article we shall have a little more look about some features of quartics. In most slices

More information

Fractals: Self-Similarity and Fractal Dimension Math 198, Spring 2013

Fractals: Self-Similarity and Fractal Dimension Math 198, Spring 2013 Fractals: Self-Similarity and Fractal Dimension Math 198, Spring 2013 Background Fractal geometry is one of the most important developments in mathematics in the second half of the 20th century. Fractals

More information

7. Stochastic Fractals

7. Stochastic Fractals Stochastic Fractals Christoph Traxler Fractals-Stochastic 1 Stochastic Fractals Simulation of Brownian motion Modelling of natural phenomena, like terrains, clouds, waves,... Modelling of microstructures,

More information

Chapel Hill Math Circle: Symmetry and Fractals

Chapel Hill Math Circle: Symmetry and Fractals Chapel Hill Math Circle: Symmetry and Fractals 10/7/17 1 Introduction This worksheet will explore symmetry. To mathematicians, a symmetry of an object is, roughly speaking, a transformation that does not

More information

PART II DYNAMICAL SYSTEMS AND CHAOS

PART II DYNAMICAL SYSTEMS AND CHAOS PART II DYNAMICAL SYSTEMS AND CHAOS CHAPTER 17 CONNECTIVITY OF JULIA SETS FOR SINGULARLY PERTURBED RATIONAL MAPS ROBERT L. DEVANEY Dept. of Mathematics, Boston University, Boston, MA 02215, USA ELIZABETH

More information

THE DEGREE OF POLYNOMIAL CURVES WITH A FRACTAL GEOMETRIC VIEW

THE DEGREE OF POLYNOMIAL CURVES WITH A FRACTAL GEOMETRIC VIEW 225 THE DEGREE OF POLYNOMIAL CURVES WITH A FRACTAL GEOMETRIC VIEW S. Mohanty 1 and A. Misra 2 1 Department of Computer Science and Applications, Utkal University, Bhubaneswar-751004, INDIA. 2 Silicon Institute

More information

Paint/Draw Tools. Foreground color. Free-form select. Select. Eraser/Color Eraser. Fill Color. Color Picker. Magnify. Pencil. Brush.

Paint/Draw Tools. Foreground color. Free-form select. Select. Eraser/Color Eraser. Fill Color. Color Picker. Magnify. Pencil. Brush. Paint/Draw Tools There are two types of draw programs. Bitmap (Paint) Uses pixels mapped to a grid More suitable for photo-realistic images Not easily scalable loses sharpness if resized File sizes are

More information

Generation of 3D Fractal Images for Mandelbrot and Julia Sets

Generation of 3D Fractal Images for Mandelbrot and Julia Sets 178 Generation of 3D Fractal Images for Mandelbrot and Julia Sets Bulusu Rama #, Jibitesh Mishra * # Department of Computer Science and Engineering, MLR Institute of Technology Hyderabad, India 1 rama_bulusu@yahoo.com

More information

Fractals. Moreno Marzolla Dip. di Informatica Scienza e Ingegneria (DISI) Università di Bologna.

Fractals. Moreno Marzolla Dip. di Informatica Scienza e Ingegneria (DISI) Università di Bologna. Fractals Moreno Marzolla Dip. di Informatica Scienza e Ingegneria (DISI) Università di Bologna http://www.moreno.marzolla.name/ 2 Geometric Objects Man-made objects are geometrically simple (e.g., rectangles,

More information

9. Three Dimensional Object Representations

9. Three Dimensional Object Representations 9. Three Dimensional Object Representations Methods: Polygon and Quadric surfaces: For simple Euclidean objects Spline surfaces and construction: For curved surfaces Procedural methods: Eg. Fractals, Particle

More information

2D Drawing Primitives

2D Drawing Primitives THE SIERPINSKI GASKET We use as a sample problem the drawing of the Sierpinski gasket an interesting shape that has a long history and is of interest in areas such as fractal geometry. The Sierpinski gasket

More information

Bending Circle Limits

Bending Circle Limits Proceedings of Bridges 2013: Mathematics, Music, Art, Architecture, Culture Bending Circle Limits Vladimir Bulatov Corvallis Oregon, USA info@bulatov.org Abstract M.C.Escher s hyperbolic tessellations

More information

18) The perpendiculars slices not intersecting origo

18) The perpendiculars slices not intersecting origo 18) The perpendiculars slices not intersecting origo In the last article regarding cubic parameter space, we had a look at those special 2D-slices of the six perpendicular systems which intersect origo.

More information

CS 543: Computer Graphics Lecture 3 (Part I): Fractals. Emmanuel Agu

CS 543: Computer Graphics Lecture 3 (Part I): Fractals. Emmanuel Agu CS 543: Computer Graphics Lecture 3 (Part I: Fractals Emmanuel Agu What are Fractals? Mathematical expressions Approach infinity in organized way Utilizes recursion on computers Popularized by Benoit Mandelbrot

More information

6.094 Introduction to MATLAB January (IAP) 2009

6.094 Introduction to MATLAB January (IAP) 2009 MIT OpenCourseWare http://ocw.mit.edu 6.094 Introduction to MATLAB January (IAP) 009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 6.094: Introduction

More information

Digital Image Processing Fundamentals

Digital Image Processing Fundamentals Ioannis Pitas Digital Image Processing Fundamentals Chapter 7 Shape Description Answers to the Chapter Questions Thessaloniki 1998 Chapter 7: Shape description 7.1 Introduction 1. Why is invariance to

More information

WXML Final Report: Shapes of Julia Sets

WXML Final Report: Shapes of Julia Sets WXML Final Report: Shapes of Julia Sets Malik Younsi, Peter Lin, Chi-Yu Cheng, Siyuan Ni, Ryan Pachauri and Xiao Li Spring 2017 Abstract In general, the complex graphical representation of Julia set is

More information

A Discussion of Julia and Mandelbrot Sets. In this paper we will examine the definitions of a Julia Set and the Mandelbrot Set, its

A Discussion of Julia and Mandelbrot Sets. In this paper we will examine the definitions of a Julia Set and the Mandelbrot Set, its Annika Awbrey Emily Clerc 4/30/14 A Discussion of Julia and Mandelbrot Sets In this paper we will examine the definitions of a Julia Set and the Mandelbrot Set, its characteristics, and the images that

More information

Some Open Problems in Graph Theory and Computational Geometry

Some Open Problems in Graph Theory and Computational Geometry Some Open Problems in Graph Theory and Computational Geometry David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science ICS 269, January 25, 2002 Two Models of Algorithms Research

More information

Fractals: a way to represent natural objects

Fractals: a way to represent natural objects Fractals: a way to represent natural objects In spatial information systems there are two kinds of entity to model: natural earth features like terrain and coastlines; human-made objects like buildings

More information

Double Integration: Non-Rectangular Domains

Double Integration: Non-Rectangular Domains Double Integration: Non-Rectangular Domains Thomas Banchoff and Associates June 18, 2003 1 Introduction In calculus of one variable, all domains are intervals which are subsets of the line. In calculus

More information

Images of Julia sets that you can trust

Images of Julia sets that you can trust Images of Julia sets that you can trust LUIZ HENRIQUE DE FIGUEIREDO and DIEGO NEHAB IMPA Instituto Nacional de Matemática Pura e Aplicada, Rio de Janeiro, Brazil and JORGE STOLFI Instituto de Computação,

More information

Fractal Image Compression

Fractal Image Compression Ball State University January 24, 2018 We discuss the works of Hutchinson, Vrscay, Kominek, Barnsley, Jacquin. Mandelbrot s Thesis 1977 Traditional geometry with its straight lines and smooth surfaces

More information

4. Definition: topological space, open set, topology, trivial topology, discrete topology.

4. Definition: topological space, open set, topology, trivial topology, discrete topology. Topology Summary Note to the reader. If a statement is marked with [Not proved in the lecture], then the statement was stated but not proved in the lecture. Of course, you don t need to know the proof.

More information

CSC 470 Computer Graphics. Fractals

CSC 470 Computer Graphics. Fractals CSC 47 Computer Graphics Fractals 1 This Week Approaches to Infinity Fractals and Self-Similarity Similarity Iterative Function Systems Lindenmayer Systems Curves Natural Images (trees, landscapes..) Introduction

More information

AP * Calculus Review. Area and Volume

AP * Calculus Review. Area and Volume AP * Calculus Review Area and Volume Student Packet Advanced Placement and AP are registered trademark of the College Entrance Examination Board. The College Board was not involved in the production of,

More information

Infinity and Uncountability. Countable Countably infinite. Enumeration

Infinity and Uncountability. Countable Countably infinite. Enumeration Infinity and Uncountability. Countable Countably infinite. Enumeration How big is the set of reals or the set of integers? Infinite! Is one bigger or smaller? Same size? Same number? Make a function f

More information

Morphological Image Processing

Morphological Image Processing Morphological Image Processing Binary image processing In binary images, we conventionally take background as black (0) and foreground objects as white (1 or 255) Morphology Figure 4.1 objects on a conveyor

More information

Scientific Calculation and Visualization

Scientific Calculation and Visualization Scientific Calculation and Visualization Topic Iteration Method for Fractal 2 Classical Electrodynamics Contents A First Look at Quantum Physics. Fractals.2 History of Fractal.3 Iteration Method for Fractal.4

More information

32) Yet more about Quartics with a first attempt to Pentics

32) Yet more about Quartics with a first attempt to Pentics 32) Yet more about Quartics with a first attempt to Pentics Now let s go further with some speculations. In Confusion1HeadJulia the connected components obviously have their shapes of CubicHeadJulia. This

More information

An Introduction to Fractals

An Introduction to Fractals An Introduction to Fractals Sarah Hardy December 10, 2018 Abstract Fractals can be defined as an infinitely complex pattern that is self-similar, that is contains replicas of itself of varying sizes, across

More information

A Selection of Interesting Sets

A Selection of Interesting Sets A Selection of January 25, 2010 A Selection of Overview Overview Set, Oh joyous sets Overview Set, Oh joyous sets Some large, some small Overview Set, Oh joyous sets Some large, some small All of them

More information

Divided-and-Conquer for Voronoi Diagrams Revisited. Supervisor: Ben Galehouse Presenter: Xiaoqi Cao

Divided-and-Conquer for Voronoi Diagrams Revisited. Supervisor: Ben Galehouse Presenter: Xiaoqi Cao Divided-and-Conquer for Voronoi Diagrams Revisited Supervisor: Ben Galehouse Presenter: Xiaoqi Cao Outline Introduction Generalized Voronoi Diagram Algorithm for building generalized Voronoi Diagram Applications

More information

Morphological Image Processing

Morphological Image Processing Morphological Image Processing Morphology Identification, analysis, and description of the structure of the smallest unit of words Theory and technique for the analysis and processing of geometric structures

More information

The Farey Tessellation

The Farey Tessellation The Farey Tessellation Seminar: Geometric Structures on manifolds Mareike Pfeil supervised by Dr. Gye-Seon Lee 15.12.2015 Introduction In this paper, we are going to introduce the Farey tessellation. Since

More information

EXAMINATIONS 2017 TRIMESTER 2

EXAMINATIONS 2017 TRIMESTER 2 EXAMINATIONS 2017 TRIMESTER 2 CGRA 151 INTRODUCTION TO COMPUTER GRAPHICS Time Allowed: TWO HOURS CLOSED BOOK Permitted materials: Silent non-programmable calculators or silent programmable calculators

More information

Answer Key: Three-Dimensional Cross Sections

Answer Key: Three-Dimensional Cross Sections Geometry A Unit Answer Key: Three-Dimensional Cross Sections Name Date Objectives In this lesson, you will: visualize three-dimensional objects from different perspectives be able to create a projection

More information

Algorithms for GIS:! Quadtrees

Algorithms for GIS:! Quadtrees Algorithms for GIS: Quadtrees Quadtree A data structure that corresponds to a hierarchical subdivision of the plane Start with a square (containing inside input data) Divide into 4 equal squares (quadrants)

More information

Unsupervised Learning : Clustering

Unsupervised Learning : Clustering Unsupervised Learning : Clustering Things to be Addressed Traditional Learning Models. Cluster Analysis K-means Clustering Algorithm Drawbacks of traditional clustering algorithms. Clustering as a complex

More information

Planar Graphs and Surfaces. Graphs 2 1/58

Planar Graphs and Surfaces. Graphs 2 1/58 Planar Graphs and Surfaces Graphs 2 1/58 Last time we discussed the Four Color Theorem, which says that any map can be colored with at most 4 colors and not have two regions that share a border having

More information

Accepting that the simple base case of a sp graph is that of Figure 3.1.a we can recursively define our term:

Accepting that the simple base case of a sp graph is that of Figure 3.1.a we can recursively define our term: Chapter 3 Series Parallel Digraphs Introduction In this chapter we examine series-parallel digraphs which are a common type of graph. They have a significant use in several applications that make them

More information

Inverse Iteration Algorithms for Julia Sets

Inverse Iteration Algorithms for Julia Sets Inverse Iteration Algorithms for Julia Sets by Mark McClure Inverse iteration algorithms are extremely fast methods to generate images of Julia sets. While they are fairly simple to understand and implement,

More information

Session 27: Fractals - Handout

Session 27: Fractals - Handout Session 27: Fractals - Handout Clouds are not spheres, mountains are not cones, coastlines are not circles, and bark is not smooth, nor does lightning travel in a straight line. Benoit Mandelbrot (1924-2010)

More information

Classification of Extremal Curves with 6 Double Points and of Tree-like Curves with 6 Double Points and I! 5

Classification of Extremal Curves with 6 Double Points and of Tree-like Curves with 6 Double Points and I! 5 Classification of Extremal Curves with 6 Double Points and of Tree-like Curves with 6 Double Points and I! 5 Tim Ritter Bethel College Mishawaka, IN timritter@juno.com Advisor: Juha Pohjanpelto Oregon

More information

Math 462: Review questions

Math 462: Review questions Math 462: Review questions Paul Hacking 4/22/10 (1) What is the angle between two interior diagonals of a cube joining opposite vertices? [Hint: It is probably quickest to use a description of the cube

More information

Lecture-12: Closed Sets

Lecture-12: Closed Sets and Its Examples Properties of Lecture-12: Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Introduction and Its Examples Properties of 1 Introduction

More information

Displaying the Internal Structure of the Mandelbrot Set

Displaying the Internal Structure of the Mandelbrot Set Displaying the Internal Structure of the Mandelbrot Set Adam Cunningham State University of New York at Buffalo Numerical Analysis MTH 537 adamcunn@buffalo.edu December 20, 2013 Abstract Although images

More information

NESTED AND FULLY AUGMENTED LINKS

NESTED AND FULLY AUGMENTED LINKS NESTED AND FULLY AUGMENTED LINKS HAYLEY OLSON Abstract. This paper focuses on two subclasses of hyperbolic generalized fully augmented links: fully augmented links and nested links. The link complements

More information

EECS490: Digital Image Processing. Lecture #17

EECS490: Digital Image Processing. Lecture #17 Lecture #17 Morphology & set operations on images Structuring elements Erosion and dilation Opening and closing Morphological image processing, boundary extraction, region filling Connectivity: convex

More information

Geometry I Can Statements I can describe the undefined terms: point, line, and distance along a line in a plane I can describe the undefined terms:

Geometry I Can Statements I can describe the undefined terms: point, line, and distance along a line in a plane I can describe the undefined terms: Geometry I Can Statements I can describe the undefined terms: point, line, and distance along a line in a plane I can describe the undefined terms: point, line, and distance along a line in a plane I can

More information

THE GRAPH OF FRACTAL DIMENSIONS OF JULIA SETS Bünyamin Demir 1, Yunus Özdemir2, Mustafa Saltan 3. Anadolu University Eskişehir, TURKEY

THE GRAPH OF FRACTAL DIMENSIONS OF JULIA SETS Bünyamin Demir 1, Yunus Özdemir2, Mustafa Saltan 3. Anadolu University Eskişehir, TURKEY International Journal of Pure and Applied Mathematics Volume 70 No. 3 2011, 401-409 THE GRAPH OF FRACTAL DIMENSIONS OF JULIA SETS Bünyamin Demir 1, Yunus Özdemir2, Mustafa Saltan 3 1,2,3 Department of

More information

Computer Graphics 4731 Lecture 5: Fractals. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)

Computer Graphics 4731 Lecture 5: Fractals. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI) Computer Graphics 4731 Lecture 5: Fractals Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI What are Fractals? Mathematical expressions to generate pretty pictures Evaluate

More information

ITERATIVE OPERATIONS IN CONSTRUCTION CIRCULAR AND SQUARE FRACTAL CARPETS

ITERATIVE OPERATIONS IN CONSTRUCTION CIRCULAR AND SQUARE FRACTAL CARPETS ITERATIVE OPERATIONS IN CONSTRUCTION CIRCULAR AND SQUARE FRACTAL CARPETS Dr. Yusra Faisal Al-Irhaim, Marah Mohamed Taha University of Mosul, Iraq ABSTRACT: Carpet designing is not only a fascinating activity

More information

Hei nz-ottopeitgen. Hartmut Jürgens Dietmar Sau pe. Chaos and Fractals. New Frontiers of Science

Hei nz-ottopeitgen. Hartmut Jürgens Dietmar Sau pe. Chaos and Fractals. New Frontiers of Science Hei nz-ottopeitgen Hartmut Jürgens Dietmar Sau pe Chaos and Fractals New Frontiers of Science Preface Authors VU X I Foreword 1 Mitchell J. Feigenbaum Introduction: Causality Principle, Deterministic

More information

(Refer Slide Time 03:00)

(Refer Slide Time 03:00) Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture #30 Visible Surface Detection (Contd ) We continue the discussion on Visible

More information

DS504/CS586: Big Data Analytics Big Data Clustering II

DS504/CS586: Big Data Analytics Big Data Clustering II Welcome to DS504/CS586: Big Data Analytics Big Data Clustering II Prof. Yanhua Li Time: 6pm 8:50pm Thu Location: AK 232 Fall 2016 More Discussions, Limitations v Center based clustering K-means BFR algorithm

More information

Construction of 3D Mandelbrot Set and Julia Set

Construction of 3D Mandelbrot Set and Julia Set Construction of 3D Mandelbrot Set and Julia Set Ankit Garg Assistant Professor Amity University, Haryana Manesar, Gurgaon Akshat Agrawal Assistant Professor Amity University, Haryana Manesar, Gurgaon Ashish

More information

Vocabulary: Looking For Pythagoras

Vocabulary: Looking For Pythagoras Vocabulary: Looking For Pythagoras Concept Finding areas of squares and other figures by subdividing or enclosing: These strategies for finding areas were developed in Covering and Surrounding. Students

More information

DS504/CS586: Big Data Analytics Big Data Clustering II

DS504/CS586: Big Data Analytics Big Data Clustering II Welcome to DS504/CS586: Big Data Analytics Big Data Clustering II Prof. Yanhua Li Time: 6pm 8:50pm Thu Location: KH 116 Fall 2017 Updates: v Progress Presentation: Week 15: 11/30 v Next Week Office hours

More information

Surface Curvature Estimation for Edge Spinning Algorithm *

Surface Curvature Estimation for Edge Spinning Algorithm * Surface Curvature Estimation for Edge Spinning Algorithm * Martin Cermak and Vaclav Skala University of West Bohemia in Pilsen Department of Computer Science and Engineering Czech Republic {cermakm skala}@kiv.zcu.cz

More information

Problem A. Interactive Smiley Face

Problem A. Interactive Smiley Face Problem A. Interactive Smiley Face 1 second Igor likes smiley faces a lot. He wrote a program that generates really large pictures of white and black pixels with smiley faces. Depending on Igor s mood,

More information

Introduction to Google SketchUp

Introduction to Google SketchUp Introduction to Google SketchUp When initially opening SketchUp, it will be useful to select the Google Earth Modelling Meters option from the initial menu. If this menu doesn t appear, the same option

More information

PLAY VIDEO. Fences can be any shape from a simple rectangle to a multisided polygon, even a circle.

PLAY VIDEO. Fences can be any shape from a simple rectangle to a multisided polygon, even a circle. Chapter Eight Groups PLAY VIDEO INTRODUCTION There will be times when you need to perform the same operation on several elements. Although this can be done by repeating the operation for each individual

More information

Vocabulary. Term Page Definition Clarifying Example. center of dilation. composition of transformations. enlargement. glide reflection.

Vocabulary. Term Page Definition Clarifying Example. center of dilation. composition of transformations. enlargement. glide reflection. CHAPTER 12 Vocabulary The table contains important vocabulary terms from Chapter 12. As you work through the chapter, fill in the page number, definition, and a clarifying example. center of dilation Term

More information

Processing of binary images

Processing of binary images Binary Image Processing Tuesday, 14/02/2017 ntonis rgyros e-mail: argyros@csd.uoc.gr 1 Today From gray level to binary images Processing of binary images Mathematical morphology 2 Computer Vision, Spring

More information

Chapter 24. Creating Surfaces for Displaying and Reporting Data

Chapter 24. Creating Surfaces for Displaying and Reporting Data Chapter 24. Creating Surfaces for Displaying and Reporting Data FLUENT allows you to select portions of the domain to be used for visualizing the flow field. The domain portions are called surfaces, and

More information

Lab 5 Mandelbrot Fractal Viewer

Lab 5 Mandelbrot Fractal Viewer Lab 5 Mandelbrot Fractal Viewer Your task is to design a digital circuit to plot a Mandelbrot Set Fractal over VGA display. Your circuit must generate all control and data signals driving the VGA output

More information

4-Border and 4-Boundary

4-Border and 4-Boundary 4-Border and 4-Boundary set S = black and white pixels; set M S = black pixels invalid edges = all edges between M and M = S \ M p M 4-inner pixel iff A 4 (p) M (shown in gray) p M 4-border pixel iff p

More information

Direction Fields; Euler s Method

Direction Fields; Euler s Method Direction Fields; Euler s Method It frequently happens that we cannot solve first order systems dy (, ) dx = f xy or corresponding initial value problems in terms of formulas. Remarkably, however, this

More information

Lecture 3: Some Strange Properties of Fractal Curves

Lecture 3: Some Strange Properties of Fractal Curves Lecture 3: Some Strange Properties of Fractal Curves I have been a stranger in a strange land. Exodus 2:22 1. Fractal Strangeness Fractals have a look and feel that is very different from ordinary curves.

More information

ON THE STRONGLY REGULAR GRAPH OF PARAMETERS

ON THE STRONGLY REGULAR GRAPH OF PARAMETERS ON THE STRONGLY REGULAR GRAPH OF PARAMETERS (99, 14, 1, 2) SUZY LOU AND MAX MURIN Abstract. In an attempt to find a strongly regular graph of parameters (99, 14, 1, 2) or to disprove its existence, we

More information

Computer Graphics (CS 543) Lecture 2c: Fractals. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)

Computer Graphics (CS 543) Lecture 2c: Fractals. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI) Computer Graphics (CS 543 Lecture c: Fractals Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI What are Fractals? Mathematical expressions to generate pretty pictures Evaluate

More information

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter

More information

Circle inversion fractals are based on the geometric operation of inversion of a point with respect to a circle, shown schematically in Fig. 1.

Circle inversion fractals are based on the geometric operation of inversion of a point with respect to a circle, shown schematically in Fig. 1. MSE 350 Creating a Circle Inversion Fractal Instructor: R.G. Erdmann In this project, you will create a self-inverse fractal using an iterated function system (IFS). 1 Background: Circle Inversion Circle

More information

1. Meshes. D7013E Lecture 14

1. Meshes. D7013E Lecture 14 D7013E Lecture 14 Quadtrees Mesh Generation 1. Meshes Input: Components in the form of disjoint polygonal objects Integer coordinates, 0, 45, 90, or 135 angles Output: A triangular mesh Conforming: A triangle

More information

Segmentation of Images

Segmentation of Images Segmentation of Images SEGMENTATION If an image has been preprocessed appropriately to remove noise and artifacts, segmentation is often the key step in interpreting the image. Image segmentation is a

More information

Topology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.

Topology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved. Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124

More information

Exploring Fractals through Geometry and Algebra. Kelly Deckelman Ben Eggleston Laura Mckenzie Patricia Parker-Davis Deanna Voss

Exploring Fractals through Geometry and Algebra. Kelly Deckelman Ben Eggleston Laura Mckenzie Patricia Parker-Davis Deanna Voss Exploring Fractals through Geometry and Algebra Kelly Deckelman Ben Eggleston Laura Mckenzie Patricia Parker-Davis Deanna Voss Learning Objective and skills practiced Students will: Learn the three criteria

More information

CSG obj. oper3. obj1 obj2 obj3. obj5. obj4

CSG obj. oper3. obj1 obj2 obj3. obj5. obj4 Solid Modeling Solid: Boundary + Interior Volume occupied by geometry Solid representation schemes Constructive Solid Geometry (CSG) Boundary representations (B-reps) Space-partition representations Operations

More information

UNIVERSITY OF WATERLOO Faculty of Mathematics

UNIVERSITY OF WATERLOO Faculty of Mathematics UNIVERSITY OF WATERLOO Faculty of Mathematics Exploring the application of Space Partitioning Methods on river segments S.S. Papadopulos & Associates Bethesda, MD, US Max Ren 20413992 3A Computer Science/BBA

More information

Mathematics 350 Section 6.3 Introduction to Fractals

Mathematics 350 Section 6.3 Introduction to Fractals Mathematics 350 Section 6.3 Introduction to Fractals A fractal is generally "a rough or fragmented geometric shape that is self-similar, which means it can be split into parts, each of which is (at least

More information

MITOCW 2. IV: Consistency, Completeness, and Geometry

MITOCW 2. IV: Consistency, Completeness, and Geometry MITOCW 2. IV: Consistency, Completeness, and Geometry The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational

More information

CGT 581 G Procedural Methods Fractals

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

More information

Hopalong Fractals. Linear complex. Quadratic complex

Hopalong Fractals. Linear complex. Quadratic complex Hopalong Fractals Hopalong fractals are created by iterating a more or less simple formula in x and y over and over again. In general three types of behaviour can be distinguished. Often the series will

More information

Lecture 3: Art Gallery Problems and Polygon Triangulation

Lecture 3: Art Gallery Problems and Polygon Triangulation EECS 396/496: Computational Geometry Fall 2017 Lecture 3: Art Gallery Problems and Polygon Triangulation Lecturer: Huck Bennett In this lecture, we study the problem of guarding an art gallery (specified

More information

A Compact Minimal Space Whose Cartesian Square Is Not Minimal

A Compact Minimal Space Whose Cartesian Square Is Not Minimal University of Dayton ecommons Summer Conference on Topology and Its Applications Department of Mathematics 6-2017 A Compact Minimal Space Whose Cartesian Square Is Not Minimal Jan P. Boronski AGH University

More information

MATH 113 Section 8.2: Two-Dimensional Figures

MATH 113 Section 8.2: Two-Dimensional Figures MATH 113 Section 8.2: Two-Dimensional Figures Prof. Jonathan Duncan Walla Walla University Winter Quarter, 2008 Outline 1 Classifying Two-Dimensional Shapes 2 Polygons Triangles Quadrilaterals 3 Other

More information

The following is a summary, hand-waving certain things which actually should be proven.

The following is a summary, hand-waving certain things which actually should be proven. 1 Basics of Planar Graphs The following is a summary, hand-waving certain things which actually should be proven. 1.1 Plane Graphs A plane graph is a graph embedded in the plane such that no pair of lines

More information

Boundary scanning and complex dynamics

Boundary scanning and complex dynamics BoundaryScanPP.nb 1 Boundary scanning and complex dynamics A preprint version of a Mathematical graphics column from Mathematica in Education and Research. Mark McClure mcmcclur@unca.edu Department of

More information

Complex Numbers, Polar Equations, and Parametric Equations. Copyright 2017, 2013, 2009 Pearson Education, Inc.

Complex Numbers, Polar Equations, and Parametric Equations. Copyright 2017, 2013, 2009 Pearson Education, Inc. 8 Complex Numbers, Polar Equations, and Parametric Equations Copyright 2017, 2013, 2009 Pearson Education, Inc. 1 8.5 Polar Equations and Graphs Polar Coordinate System Graphs of Polar Equations Conversion

More information

Fractals and the Chaos Game

Fractals and the Chaos Game Math: Outside the box! Fractals and the Chaos Game Monday February 23, 2009 3:30-4:20 IRMACS theatre, ASB 10900 Randall Pyke Senior Lecturer Department of Mathematics, SFU A Game. Is this a random walk?

More information

Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams

Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams Khalegh Mamakani and Frank Ruskey Dept. of Computer Science, University of Victoria, Canada. Abstract. An n-venn diagram consists

More information

Chapter 8 Getting Started with Draw:

Chapter 8 Getting Started with Draw: Getting Started Guide Chapter 8 Getting Started with Draw: OpenOffice.org s Vector Graphics Drawing Tool OpenOffice.org Copyright This document is Copyright 2005 by its contributors as listed in the section

More information

EECS490: Digital Image Processing. Lecture #23

EECS490: Digital Image Processing. Lecture #23 Lecture #23 Motion segmentation & motion tracking Boundary tracking Chain codes Minimum perimeter polygons Signatures Motion Segmentation P k Accumulative Difference Image Positive ADI Negative ADI (ADI)

More information

Applications. 44 Stretching and Shrinking

Applications. 44 Stretching and Shrinking Applications 1. Look for rep-tile patterns in the designs below. For each design, tell whether the small quadrilaterals are similar to the large quadrilateral. Explain. If the quadrilaterals are similar,

More information