Drawing the Mandelbrot Set

Slides:



Advertisements
Similar presentations
2006 by Jim X. Chen: 1.1. Review –Graphics commands specify straight lines or other geometric primitives that are scan-converted.
Advertisements

Chapter 6: Roots: Open Methods
Prepared 7/28/2011 by T. O’Neil for 3460:677, Fall 2011, The University of Akron.
Isotherm LAB.
Embarrassingly Parallel (or pleasantly parallel) Domain divisible into a large number of independent parts. Minimal or no communication Each processor.
Graphics Programming: Polygon Filling
Computer Vision : CISC 4/689 Adaptation from: Prof. James M. Rehg, G.Tech.
CS 4731: Computer Graphics Lecture 5: Fractals Emmanuel Agu.
First Bytes - LabVIEW. Today’s Session Introduction to LabVIEW Colors and computers Lab to create a color picker Lab to manipulate an image Visual ProgrammingImage.
Computer Vision Lecture 3: Digital Images
1 Internet Graphics. 2 Representing Images  Raster Image: Images consist of “dots” of color, not lines  Pixel: Picture element-tiny rectangle  Resolution:
IE433 CAD/CAM Computer Aided Design and Computer Aided Manufacturing Part-2 CAD Systems Industrial Engineering Department King Saud University.
Computer Graphics Using “ Adobe Photoshop ” Introduction to E-Learning Center, DAD presents Workshop on Instructor: Mazhar.
Co mputer Graphics Researched via: Student Name: Nathalie Gresseau Date:12/O7/1O.
Objective Understand concepts used to create digital graphics. Course Weight : 15% Part Three : Concepts of Digital Graphics.
Experiments with MATLAB Mandelbrot Set Roger Jang ( 張智星 ) CSIE Dept, National Taiwan University
Computer Graphics Lecture 1 July 11, Computer Graphics What do you think of? The term “computer graphics” is a blanket term used to refer to the.
Week 2 - Wednesday CS361.
Ch 9 Infinity page 1CSC 367 Fractals (9.2) Self similar curves appear identical at every level of detail often created by recursively drawing lines.
Computer Graphics Researched via: Student Name: Cheyenne Bell Date: 04/29/2010.
Slides for Parallel Programming Techniques & Applications Using Networked Workstations & Parallel Computers 2nd ed., by B. Wilkinson & M
Digital Image Processing NET 404) ) Introduction and Overview
Beam Penetration & Shadow Mask Method
Mandelbrot Set Fractal
Computer Science 320 Parallel Image Generation. The Mandelbrot Set.
PART TWO Electronic Color & RGB values 1. Electronic Color Computer Monitors: Use light in 3 colors to create images on the screen Monitors use RED, GREEN,
Lecture 13: Raster Graphics and Scan Conversion
Chapter 1 Lesson 3 Mapping Technology How are maps made? What are GPS and GIS?
Computer Graphics: Programming, Problem Solving, and Visual Communication Steve Cunningham California State University Stanislaus and Grinnell College.
Computer Graphic. Raster graphics In computer graphics, a raster graphics image, digital image, or bitmap, is a data structure representing a generally.
The Cathode Ray Tube Monitor
Images provided by Ohio University’s Witmer Lab for STEM educational aids for K–12 Researchers conducted a CT scan of the head of a 41-year-old male white.
Graphics 1 Graphics 2 Color 2 I Spy 1pt 1 pt 1 pt 1pt 1 pt 2 pt 2 pt
Color Color is one of the most interesting aspects of both human perception and computer graphics. In principle, a display needs only three primary colors.
The Colour of Light: Additive colour theory.
Digital Data Format and Storage
ITERATIVE DYNAMIC SYSTEMS THROUGH THE MANDELBROT AND JULIA SETS
Chapter I Digital Imaging Fundamentals
Periodic Table Notes.
Microprocessor and Assembly Language
Some terms to become familiar with:
Spatial Analysis: Raster
Characteristics of Stars
Three-Dimensional Concepts. Three Dimensional Graphics  It is the field of computer graphics that deals with generating and displaying three dimensional.
Introduction to Computers
CS320n –Visual Programming
Color Values All colors in computer images are a combination of red, green and blue Each component is encoded as a number means the color is.
Computer Graphics Using “Adobe Photoshop”
graphics by Prettygrafik design
ART 1 Mid-Term Created by Educational Technology Network
Dr. Chang Shu COMP 4900C Winter 2008
The Graphics Pipeline Lecture 5 Mon, Sep 3, 2007.
Align The Stars Continue.
Chap. 3 Functions Start Python IDLE (Shell) and open a new file.
Art Programs Raise Deep Questions
Periodic Table Notes.
Visibility (hidden surface removal)
COMS 161 Introduction to Computing
Spatial Analysis: Raster
What Color is it?.
Digital Image Processing
Nested Loops Circles inside Circles
Visuals are analog signals...
Nested Loops Circles inside Circles
Game Programming Algorithms and Techniques
The Great Depression in Europe
Non-numeric Data Representation
ECE 448: Spring 2016 Lab 5 Julia Set Fractal.
Ch Stars Chapter 19, Section 1 Part 2.
Introduction to High Performance Computing Lecture 8
Presentation transcript:

Drawing the Mandelbrot Set Sep. 19 Dae-Eun Hyun 3D MAP Lab.

What is the Mandelbrot Set? Def. The Mandelbrot Set M is the set of all complex numbers c that produces a finite orbit of 0.

What is the Mandelbrot Set? The points of the complex plane in two categories Points inside the Mandelbrot Set Points outside the Mandelbrot Set

Computing the Mandelbrot Set How we can decide the convergency? Set the maximum magnitude of | Zk | Typically 2 How many we have to iterate? Set some upper limit Number on the maximum number of iterations Typically 100 ~ 400

Computing the Mandelbrot Set C inside the set C outside the set

Drawing the Mandelbrot Set Display M on the raster graphics Set up a correpondence between each pixel on the display and a value of C, and the iteration number for that C-value is found. Example Bright yellow to C near outside the set Dimmer yellow to C farther away from the set Deep Blue to C have the small iteration Num

Drawing the Mandelbrot Set Color Intensity Red Blue Num Float v = d/ float Num; glColor3f(v*v, v*v, v, 0.2);

Drawing the Mandelbrot Set How to associate a pixel with a specific complex value of C Image : the Number of Rows the Number of Columns

Drawing the Mandelbrot Set Pseudocode for Drawing for( j = 0; j < rows; j++) for( i = 0; i < cols; I++) { find the correspondence c-value for Pixel (i,j); estimate the iteration Number of the orbit; find Color determined the iteration Number; setPixel(j, i, Color); }