Presentation is loading. Please wait.

Presentation is loading. Please wait.

Building Fractal Landscapes

Published byPaul McCarthy Modified over 6 years ago

Similar presentations

Presentation on theme: "Building Fractal Landscapes"— Presentation transcript:

1 Building Fractal Landscapes
Henry Kwan

2 Diamond-square algorithm
Generate random terrain with iterations of: Diamond Step Set square(s) center value(s) = Average of four corner values + random value Square Step Set diamond(s) center value(s) = Average of corner values + random value Initial Terrain 1st Pass Diamond Step 1st Pass Square Step 2nd Pass Diamond Step 2nd Pass Square Step

3 33x33 Landscape To generate a 33x33 landscape, run:
>> landscape_fractal(5)

4 129x129 Landscape To generate a 129x129 landscape, run:
>> landscape_fractal(7)

Download ppt "Building Fractal Landscapes"

Similar presentations

1 Line replacement approach Koch Star (Snowflake) Area replacement approach Sierpenski Triangle Iterated Function System approach Heighway Dragon CSE 20232.

1 Line replacement approach Koch Star (Snowflake) Area replacement approach Sierpenski Triangle Iterated Function System approach Heighway Dragon CSE
2.4 Write Equations of Lines

2.4 Write Equations of Lines
Number Grid Task Task 1Task 2Task 3Task 4 Task 5Task 6Task 7Task 8 Task 9Task 10 NC Level 5 to 8.

Number Grid Task Task 1Task 2Task 3Task 4 Task 5Task 6Task 7Task 8 Task 9Task 10 NC Level 5 to 8.
Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.

Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.
Created By: Pamala (Alston) Sanchez Counting with Baseball is a simple thing you see.

Created By: Pamala (Alston) Sanchez Counting with Baseball is a simple thing you see.
Albrecht Dürer And his magic square. On the wall to the right hangs the magic square Dürer created.

Albrecht Dürer And his magic square. On the wall to the right hangs the magic square Dürer created.
      H-13 

      H-13 
Selection and Insertion Sort Mrs. C. Furman October 1, 2008.

Selection and Insertion Sort Mrs. C. Furman October 1, 2008.
Dave Lattanzi’s RRT Algorithm. General Concept Use dictionaries for trees Create a randomized stack of nodes Iterate through stack “Extend” each tree.

Dave Lattanzi’s RRT Algorithm. General Concept Use dictionaries for trees Create a randomized stack of nodes Iterate through stack “Extend” each tree.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.

COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Unit 4 Review Solutions. 1. 12a 5 – 32a 2 4a 2 (3a 3 – 8) 2. a 2 b 2 + ab ab(ab + 1) 3. x(x – 2) + y(2 – x) x(x – 2) – y(x – 2) (x – 2)(x – y)

Unit 4 Review Solutions a 5 – 32a 2 4a 2 (3a 3 – 8) 2. a 2 b 2 + ab ab(ab + 1) 3. x(x – 2) + y(2 – x) x(x – 2) – y(x – 2) (x – 2)(x – y)
Near-duplicates detection Comparison of the two algorithms seen in class Romain Colle.

Near-duplicates detection Comparison of the two algorithms seen in class Romain Colle.
Circles Notes. 1 st Day A circle is the set of all points P in a plane that are the same distance from a given point. The given distance is the radius.

Circles Notes. 1 st Day A circle is the set of all points P in a plane that are the same distance from a given point. The given distance is the radius.
Evaluating Performance for Data Mining Techniques

Evaluating Performance for Data Mining Techniques
Spring 2012Meetings 5 and 6, 7:20PM-10PM Image Processing with Applications-CSCI567/MATH563/MATH489 Lectures 8, 9, 10,11: Spatial Filtering 8. Linear Filters,

Spring 2012Meetings 5 and 6, 7:20PM-10PM Image Processing with Applications-CSCI567/MATH563/MATH489 Lectures 8, 9, 10,11: Spatial Filtering 8. Linear Filters,
*Draw this diagram in your notes. *It should be in landscape and take up the whole page.

*Draw this diagram in your notes. *It should be in landscape and take up the whole page.
1 Landscape Generation with L-Systems By: David Cole Supervisor: Jon McCormack.

1 Landscape Generation with L-Systems By: David Cole Supervisor: Jon McCormack.
      H-13 

      H-13 
11.5 = Recursion & Iteration. Arithmetic = adding (positive or negative)

11.5 = Recursion & Iteration. Arithmetic = adding (positive or negative)
Random Terrain Generation By Cliff DeKoker. About my project ● Incremental development ● Focus on creating height maps that mimic real terrain ● Allow.

Random Terrain Generation By Cliff DeKoker. About my project ● Incremental development ● Focus on creating height maps that mimic real terrain ● Allow.

Similar presentations

Ads by Google