A DIVIDE AND CONQUER METHOD FOR CURVE DRAWING

Size: px
Start display at page:

Download "A DIVIDE AND CONQUER METHOD FOR CURVE DRAWING"

Transcription

1 ECS 78 Course Notes A DIVIDE AND CONQUER METHOD FOR CURVE DRAWING Kenneth I. Joy Institute for Data Analysis and Visualization Department of Computer Science University of California, Davis Overview In the late 960s, two European engineers independently developed a mathematical curve formulation which was extremely useful for modeling and design and also easily adaptable to use on a computer system. The primary feature of this method was that the controlling parameters of the curve were simply points in three-dimensional space, and each of these points had an influence on the curve. This curve, commonly called the Bézier curve, is the representation that is most frequently used in computer graphics and geometric modeling. Here we present a method to generate a Bézier curve through a simple divide-and-conquer, or subdivision method. This will not give us a rigorous definition of the curve, but will serve as motivation as it follows the general construction procedure for the curve. Plus, it s cool!!! The Subdivision Procedure Our curve is defined by using three control points, P, and. [We ll start with three points, but the procedure will generally work with curves defined by n points.] Normally, these points can be arbitrarily placed in three-dimensional space, but for illustration purposes, we will limit ourselves to two-dimensions, and will use the points given in the illustration below. You will get the idea how things work.

2 P We normally call the points, P and control points, as they define and influence the curve. The curve is going to pass through the points and and will lie within the triangle P. P is a control point that serves as a handle or a influence on the curve. It is normally off the curve, only lying on the curve in very specific cases. Our divide and conquer procedure will split or subdivide the curve into two segments, each of which is again specified by three control points. With this procedure, we can recursively generate many small segments of the curve, which can be eventually approximated by straight lines when the curve is to be drawn. The procedure is quite simple, the most complicated mathematics being the calculation of midpoints of the lines connecting control points. The Basic Subdivision Procedure The procedure to subdivide the curve into two segments can be described as follows: First, let be the midpoint of the segment P, P then, let be the midpoint of segment P,

3 P and finally let P () be the midpoint of the segment P(). P P () We define P () to be a point on the curve. Simple procedure. Right??? Let s see what we have done. First, the notation is rather unusual, but we will use this over and over as we go along in the course, and I wanted to introduce it here. Just let me say get used to it! When you see notation of this type, you should anticipate that a P (j) i will appear soon, and it certainly will. We have generated another point on the curve P (). We already had two points on the curve, and, and now we have a third. We have effectively subdivided the curve into two segments. The first segment has control { } points,, P() (note that the beginning and end points are both on the curve, and the middle point is influencing the curve.), and the second segment has control points { } P (), P(),. 3

4 P Point on the curve P () New control points New control points So, our simple procedure has generated an additional point on the curve and two new sets of three control points. Now, we will work on each new piece to generate additional points on the curve. See what s coming??? Continuing the Subdivision Performing the procedure again, we use the control points {,, P() }, relabeling them for convenience as, P, and respectively, and again apply our procedure to generate a point on the curve. P First let be the midpoint of the segment P. 4

5 P then let be the midpoint of segment P. P and finally let P () as the midpoint of the segment P(). P P () We now define P () to be a point on the curve. So, we have produced another point on the curve, and created two new sets of control points. If we consider the control points P (), P(), and, generated in the first subdivision, and relabel them as, P, and respectively, we can again apply the subdivision procedure 5

6 P P P P as the midpoint of the segment P. as the midpoint of segment P. P () as the midpoint of the segment P(). P () 6

7 And again, P () is on the curve. The Subdivision Algorithm We now have five points on the curve,, P, and our three new generated points, and have generated four subcurves that we can use to generate additional points. You should now see how to proceed. At each step the process creates both a point on the curve and two new sets of control points, recursively subdividing the curve segments into two new curve segments, each of which can be handled in the same way. P The curve drawn by this method is a quadratic Bézier curve. Summary This is a somewhat unique method to define a curve, and probably not previously seen by many students. It is a geometric method, as it uses only the midpoint formula as it s fundamental tool. It uses the basic computer science paradigm of (sub)divide and conquer to calculate points on the curve. The curve can be drawn using computer graphics by calculating a somewhat-dense set of points, and connecting them with straight lines. All contents copyright (c) Computer Science Department, University of California, Davis All rights reserved. 7

A MATRIX FORMULATION OF THE CUBIC BÉZIER CURVE

A MATRIX FORMULATION OF THE CUBIC BÉZIER CURVE Geometric Modeling Notes A MATRIX FORMULATION OF THE CUBIC BÉZIER CURVE Kenneth I. Joy Institute for Data Analysis and Visualization Department of Computer Science University of California, Davis Overview

More information

ECS 178 Course Notes REFINEMENT

ECS 178 Course Notes REFINEMENT ECS 78 Course Notes REFINEMENT Kenneth I Joy Institute for Data Analysis and Visualization Department of Computer Science University of California, Davis Overview Bézier curves, B-spline curves and subdivision

More information

SPLITTING THE CUBIC UNIFORM B-SPLINE CURVE

SPLITTING THE CUBIC UNIFORM B-SPLINE CURVE On-Line Geometric odeling Notes SPLITTING THE CUBIC UNIFOR B-SPLINE CURVE Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis Overview

More information

On-Line Geometric Modeling Notes REFINEMENT

On-Line Geometric Modeling Notes REFINEMENT On-Line Geometric Modeling Notes REFINEMENT Kenneth I Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis Overview Bézier curves, B-spline curves

More information

CHAIKIN S ALGORITHMS FOR CURVES

CHAIKIN S ALGORITHMS FOR CURVES On-Line Geometric Modeling Notes CHAIKIN S ALGORITHMS FOR CURVES Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis Overview In 1974,

More information

QUADRATIC UNIFORM B-SPLINE CURVE REFINEMENT

QUADRATIC UNIFORM B-SPLINE CURVE REFINEMENT On-Line Geometric Modeling Notes QUADRATIC UNIFORM B-SPLINE CURVE REFINEMENT Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis Overview

More information

Design and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute

Design and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute Design and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute Module 07 Lecture - 38 Divide and Conquer: Closest Pair of Points We now look at another divide and conquer algorithm,

More information

Lecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10

Lecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 Lecture 25: Bezier Subdivision And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 1. Divide and Conquer If we are going to build useful

More information

Curve Construction via Local Fitting

Curve Construction via Local Fitting Curve Construction via Local Fitting Suppose we are given points and tangents Q k, and T k (k = 0,..., n), and a fitting tolerance ε. We want to fit this data with the minimum (in some sense) number of

More information

Parametric Curves. University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell

Parametric Curves. University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Parametric Curves University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Parametric Representations 3 basic representation strategies: Explicit: y = mx + b Implicit: ax + by + c

More information

Parametric Curves. University of Texas at Austin CS384G - Computer Graphics

Parametric Curves. University of Texas at Austin CS384G - Computer Graphics Parametric Curves University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Parametric Representations 3 basic representation strategies: Explicit: y = mx + b Implicit: ax + by + c

More information

Lecture IV Bézier Curves

Lecture IV Bézier Curves Lecture IV Bézier Curves Why Curves? Why Curves? Why Curves? Why Curves? Why Curves? Linear (flat) Curved Easier More pieces Looks ugly Complicated Fewer pieces Looks smooth What is a curve? Intuitively:

More information

THE VIEWING TRANSFORMATION

THE VIEWING TRANSFORMATION ECS 178 Course Notes THE VIEWING TRANSFORMATION Kenneth I. Joy Institute for Data Analysis and Visualization Department of Computer Science University of California, Davis Overview One of the most important

More information

RASTERIZING POLYGONS IN IMAGE SPACE

RASTERIZING POLYGONS IN IMAGE SPACE On-Line Computer Graphics Notes RASTERIZING POLYGONS IN IMAGE SPACE Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis A fundamental

More information

In this course we will need a set of techniques to represent curves and surfaces in 2-d and 3-d. Some reasons for this include

In this course we will need a set of techniques to represent curves and surfaces in 2-d and 3-d. Some reasons for this include Parametric Curves and Surfaces In this course we will need a set of techniques to represent curves and surfaces in 2-d and 3-d. Some reasons for this include Describing curves in space that objects move

More information

CSE 167: Introduction to Computer Graphics Lecture 12: Bézier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2013

CSE 167: Introduction to Computer Graphics Lecture 12: Bézier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2013 CSE 167: Introduction to Computer Graphics Lecture 12: Bézier Curves Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2013 Announcements Homework assignment 5 due tomorrow, Nov

More information

and the crooked shall be made straight, and the rough ways shall be made smooth; Luke 3:5

and the crooked shall be made straight, and the rough ways shall be made smooth; Luke 3:5 ecture 8: Knot Insertion Algorithms for B-Spline Curves and Surfaces and the crooked shall be made straight, and the rough ways shall be made smooth; uke 3:5. Motivation B-spline methods have several advantages

More information

Computergrafik. Matthias Zwicker Universität Bern Herbst 2016

Computergrafik. Matthias Zwicker Universität Bern Herbst 2016 Computergrafik Matthias Zwicker Universität Bern Herbst 2016 Today Curves NURBS Surfaces Parametric surfaces Bilinear patch Bicubic Bézier patch Advanced surface modeling 2 Piecewise Bézier curves Each

More information

Computergrafik. Matthias Zwicker. Herbst 2010

Computergrafik. Matthias Zwicker. Herbst 2010 Computergrafik Matthias Zwicker Universität Bern Herbst 2010 Today Curves NURBS Surfaces Parametric surfaces Bilinear patch Bicubic Bézier patch Advanced surface modeling Piecewise Bézier curves Each segment

More information

CSE 167: Introduction to Computer Graphics Lecture #11: Bezier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2016

CSE 167: Introduction to Computer Graphics Lecture #11: Bezier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2016 CSE 167: Introduction to Computer Graphics Lecture #11: Bezier Curves Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2016 Announcements Project 3 due tomorrow Midterm 2 next

More information

2D Spline Curves. CS 4620 Lecture 18

2D Spline Curves. CS 4620 Lecture 18 2D Spline Curves CS 4620 Lecture 18 2014 Steve Marschner 1 Motivation: smoothness In many applications we need smooth shapes that is, without discontinuities So far we can make things with corners (lines,

More information

CSE 167: Introduction to Computer Graphics Lecture #13: Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2017

CSE 167: Introduction to Computer Graphics Lecture #13: Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2017 CSE 167: Introduction to Computer Graphics Lecture #13: Curves Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2017 Announcements Project 4 due Monday Nov 27 at 2pm Next Tuesday:

More information

Curves. Computer Graphics CSE 167 Lecture 11

Curves. Computer Graphics CSE 167 Lecture 11 Curves Computer Graphics CSE 167 Lecture 11 CSE 167: Computer graphics Polynomial Curves Polynomial functions Bézier Curves Drawing Bézier curves Piecewise Bézier curves Based on slides courtesy of Jurgen

More information

An experienced mathematics teacher guides students through the use of a number of very important skills in coordinate geometry.

An experienced mathematics teacher guides students through the use of a number of very important skills in coordinate geometry. Mathematics Stills from our new series Coordinates An experienced mathematics teacher guides students through the use of a number of very important skills in coordinate geometry. Distance between Two Points

More information

Chapter 12: Fractal Geometry The Koch Snowflake and Self-Similarity

Chapter 12: Fractal Geometry The Koch Snowflake and Self-Similarity Chapter 12: Fractal Geometry 12.1 The Koch Snowflake and Self-Similarity Geometric Fractal Our first example of a geometric fractal is a shape known as the Koch snowflake, named after the Swedish mathematician

More information

Sorting. Order in the court! sorting 1

Sorting. Order in the court! sorting 1 Sorting Order in the court! sorting 1 Importance of sorting Sorting a list of values is a fundamental task of computers - this task is one of the primary reasons why people use computers in the first place

More information

n! = 1 * 2 * 3 * 4 * * (n-1) * n

n! = 1 * 2 * 3 * 4 * * (n-1) * n The Beauty and Joy of Computing 1 Lab Exercise 9: Problem self-similarity and recursion Objectives By completing this lab exercise, you should learn to Recognize simple self-similar problems which are

More information

For many years, geometry in the elementary schools was confined to

For many years, geometry in the elementary schools was confined to SHOW 118 PROGRAM SYNOPSIS Segment 1 (1:39) MATHMAN: RECTANGLES Mathman is told to eat only the rectangles that appear on his video game board. He notes that rectangles must have four right angles (and

More information

Computer Graphics Curves and Surfaces. Matthias Teschner

Computer Graphics Curves and Surfaces. Matthias Teschner Computer Graphics Curves and Surfaces Matthias Teschner Outline Introduction Polynomial curves Bézier curves Matrix notation Curve subdivision Differential curve properties Piecewise polynomial curves

More information

Central issues in modelling

Central issues in modelling Central issues in modelling Construct families of curves, surfaces and volumes that can represent common objects usefully; are easy to interact with; interaction includes: manual modelling; fitting to

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

THE CAMERA TRANSFORM

THE CAMERA TRANSFORM On-Line Computer Graphics Notes THE CAMERA TRANSFORM Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis Overview To understanding the

More information

Sorting. Order in the court! sorting 1

Sorting. Order in the court! sorting 1 Sorting Order in the court! sorting 1 Importance of sorting Sorting a list of values is a fundamental task of computers - this task is one of the primary reasons why people use computers in the first place

More information

Chapter 2. Frequency distribution. Summarizing and Graphing Data

Chapter 2. Frequency distribution. Summarizing and Graphing Data Frequency distribution Chapter 2 Summarizing and Graphing Data Shows how data are partitioned among several categories (or classes) by listing the categories along with the number (frequency) of data values

More information

Algorithms. Lecture Notes 5

Algorithms. Lecture Notes 5 Algorithms. Lecture Notes 5 Dynamic Programming for Sequence Comparison The linear structure of the Sequence Comparison problem immediately suggests a dynamic programming approach. Naturally, our sub-instances

More information

Bezier Curves. An Introduction. Detlef Reimers

Bezier Curves. An Introduction. Detlef Reimers Bezier Curves An Introduction Detlef Reimers detlefreimers@gmx.de http://detlefreimers.de September 1, 2011 Chapter 1 Bezier Curve Basics 1.1 Linear Interpolation This section will give you a basic introduction

More information

Graphing Linear Equations and Inequalities: Graphing Linear Equations and Inequalities in One Variable *

Graphing Linear Equations and Inequalities: Graphing Linear Equations and Inequalities in One Variable * OpenStax-CNX module: m18877 1 Graphing Linear Equations and Inequalities: Graphing Linear Equations and Inequalities in One Variable * Wade Ellis Denny Burzynski This work is produced by OpenStax-CNX and

More information

From curves to surfaces. Parametric surfaces and solid modeling. Extrusions. Surfaces of revolution. So far have discussed spline curves in 2D

From curves to surfaces. Parametric surfaces and solid modeling. Extrusions. Surfaces of revolution. So far have discussed spline curves in 2D From curves to surfaces Parametric surfaces and solid modeling CS 465 Lecture 12 2007 Doug James & Steve Marschner 1 So far have discussed spline curves in 2D it turns out that this already provides of

More information

Geometric Constructions

Geometric Constructions HISTORY OF MATHEMATICS Spring 2005 Geometric Constructions Notes, activities, assignment; #3 in a series. Note: I m not giving a specific due date for this somewhat vague assignment. The idea is that it

More information

Modeling. Simulating the Everyday World

Modeling. Simulating the Everyday World Modeling Simulating the Everyday World Three broad areas: Modeling (Geometric) = Shape Animation = Motion/Behavior Rendering = Appearance Page 1 Geometric Modeling 1. How to represent 3d shapes Polygonal

More information

Intro to Modeling Modeling in 3D

Intro to Modeling Modeling in 3D Intro to Modeling Modeling in 3D Polygon sets can approximate more complex shapes as discretized surfaces 2 1 2 3 Curve surfaces in 3D Sphere, ellipsoids, etc Curved Surfaces Modeling in 3D ) ( 2 2 2 2

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

Information Coding / Computer Graphics, ISY, LiTH. Splines

Information Coding / Computer Graphics, ISY, LiTH. Splines 28(69) Splines Originally a drafting tool to create a smooth curve In computer graphics: a curve built from sections, each described by a 2nd or 3rd degree polynomial. Very common in non-real-time graphics,

More information

DRAWING QUADRATIC GRAPHS (EDEXCEL HIGHER) These questions are suitable for Higher Tier students. All questions should be done without a calculator.

DRAWING QUADRATIC GRAPHS (EDEXCEL HIGHER) These questions are suitable for Higher Tier students. All questions should be done without a calculator. GCSE MATHEMATICS KEY TOPIC PRACTICE SHEETS DRAWING QUADRATIC GRAPHS (EDEXCEL HIGHER) These questions are suitable for Higher Tier students. All questions should be done without a calculator. www.tutor2u.net/maths

More information

Geodesic Domes. Tom Davis September 15, 2004

Geodesic Domes. Tom Davis  September 15, 2004 eodesic Domes Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles September 15, 2004 1 What Is a eodesic Dome? igure 1: 6V eodesic Dome and uckminster uller Stamp The geodesic dome was

More information

Lecture 9: Introduction to Spline Curves

Lecture 9: Introduction to Spline Curves Lecture 9: Introduction to Spline Curves Splines are used in graphics to represent smooth curves and surfaces. They use a small set of control points (knots) and a function that generates a curve through

More information

Computer Graphics. Unit VI: Curves And Fractals. By Vaishali Kolhe

Computer Graphics. Unit VI: Curves And Fractals. By Vaishali Kolhe Computer Graphics Unit VI: Curves And Fractals Introduction Two approaches to generate curved line 1. Curve generation algorithm Ex. DDA Arc generation algorithm 2. Approximate curve by number of straight

More information

Kuratowski Notes , Fall 2005, Prof. Peter Shor Revised Fall 2007

Kuratowski Notes , Fall 2005, Prof. Peter Shor Revised Fall 2007 Kuratowski Notes 8.30, Fall 005, Prof. Peter Shor Revised Fall 007 Unfortunately, the OCW notes on Kuratowski s theorem seem to have several things substantially wrong with the proof, and the notes from

More information

Programming in C++ Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Programming in C++ Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Programming in C++ Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 43 Dynamic Binding (Polymorphism): Part III Welcome to Module

More information

Chapter 2: The Normal Distribution

Chapter 2: The Normal Distribution Chapter 2: The Normal Distribution 2.1 Density Curves and the Normal Distributions 2.2 Standard Normal Calculations 1 2 Histogram for Strength of Yarn Bobbins 15.60 16.10 16.60 17.10 17.60 18.10 18.60

More information

Student Outcomes. Lesson Notes. Classwork. Opening Exercise (3 minutes)

Student Outcomes. Lesson Notes. Classwork. Opening Exercise (3 minutes) Student Outcomes Students solve problems related to the distance between points that lie on the same horizontal or vertical line Students use the coordinate plane to graph points, line segments and geometric

More information

I. Recursive Descriptions A phrase like to get the next term you add 2, which tells how to obtain

I. Recursive Descriptions A phrase like to get the next term you add 2, which tells how to obtain Mathematics 45 Describing Patterns in s Mathematics has been characterized as the science of patterns. From an early age students see patterns in mathematics, including counting by twos, threes, etc.,

More information

A point is pictured by a dot. While a dot must have some size, the point it represents has no size. Points are named by capital letters..

A point is pictured by a dot. While a dot must have some size, the point it represents has no size. Points are named by capital letters.. Chapter 1 Points, Lines & Planes s we begin any new topic, we have to familiarize ourselves with the language and notation to be successful. My guess that you might already be pretty familiar with many

More information

About Graphing Lines

About Graphing Lines About Graphing Lines TABLE OF CONTENTS About Graphing Lines... 1 What is a LINE SEGMENT?... 1 Ordered Pairs... 1 Cartesian Co-ordinate System... 1 Ordered Pairs... 2 Line Segments... 2 Slope of a Line

More information

Prepare a stem-and-leaf graph for the following data. In your final display, you should arrange the leaves for each stem in increasing order.

Prepare a stem-and-leaf graph for the following data. In your final display, you should arrange the leaves for each stem in increasing order. Chapter 2 2.1 Descriptive Statistics A stem-and-leaf graph, also called a stemplot, allows for a nice overview of quantitative data without losing information on individual observations. It can be a good

More information

Dgp _ lecture 2. Curves

Dgp _ lecture 2. Curves Dgp _ lecture 2 Curves Questions? This lecture will be asking questions about curves, their Relationship to surfaces, and how they are used and controlled. Topics of discussion will be: Free form Curves

More information

Did you ever think that a four hundred year-old spider may be why we study linear relationships today?

Did you ever think that a four hundred year-old spider may be why we study linear relationships today? Show Me: Determine if a Function is Linear M8221 Did you ever think that a four hundred year-old spider may be why we study linear relationships today? Supposedly, while lying in bed Rene Descartes noticed

More information

Functions Review Packet from November Questions. 1. The diagrams below show the graphs of two functions, y = f(x), and y = g(x). y y

Functions Review Packet from November Questions. 1. The diagrams below show the graphs of two functions, y = f(x), and y = g(x). y y Functions Review Packet from November Questions. The diagrams below show the graphs of two functions, = f(), and = g()..5 = f( ) = g( ).5 6º 8º.5 8º 6º.5 State the domain and range of the function f; the

More information

Here are some of the more basic curves that we ll need to know how to do as well as limits on the parameter if they are required.

Here are some of the more basic curves that we ll need to know how to do as well as limits on the parameter if they are required. 1 of 10 23/07/2016 05:15 Paul's Online Math Notes Calculus III (Notes) / Line Integrals / Line Integrals - Part I Problems] [Notes] [Practice Problems] [Assignment Calculus III - Notes Line Integrals Part

More information

A Curve Tutorial for Introductory Computer Graphics

A Curve Tutorial for Introductory Computer Graphics A Curve Tutorial for Introductory Computer Graphics Michael Gleicher Department of Computer Sciences University of Wisconsin, Madison October 7, 2003 Note to 559 Students: These notes were put together

More information

COMPUTING CONSTRAINED DELAUNAY

COMPUTING CONSTRAINED DELAUNAY COMPUTING CONSTRAINED DELAUNAY TRIANGULATIONS IN THE PLANE By Samuel Peterson, University of Minnesota Undergraduate The Goal The Problem The Algorithms The Implementation Applications Acknowledgments

More information

Graphics. Graphics. Graphics. Graphics

Graphics. Graphics. Graphics. Graphics Curvy Tricks T T T E T E T X E E X E X E X X and and and and and and Graphics Graphics Graphics Graphics Graphics c,, Trivandrum 69, india /6 . Curvy Tricks We ve seen how the \psline command can be used

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

Keyword: Quadratic Bézier Curve, Bisection Algorithm, Biarc, Biarc Method, Hausdorff Distances, Tolerance Band.

Keyword: Quadratic Bézier Curve, Bisection Algorithm, Biarc, Biarc Method, Hausdorff Distances, Tolerance Band. Department of Computer Science Approximation Methods for Quadratic Bézier Curve, by Circular Arcs within a Tolerance Band Seminar aus Informatik Univ.-Prof. Dr. Wolfgang Pree Seyed Amir Hossein Siahposhha

More information

Unit 1 Geometric Fundamentals

Unit 1 Geometric Fundamentals Honors Geometry Unit 1 Geometric Fundamentals Date Target Assignment Done! R 8-17 1.1a 1.1a Worksheet F 8-18 1.1b Pre-Assessment / 1.1b Worksheet M 8-21 1.1 1.2a Worksheet T 8-22 1.2a 1.2b Worksheet W

More information

Triangulation and Convex Hull. 8th November 2018

Triangulation and Convex Hull. 8th November 2018 Triangulation and Convex Hull 8th November 2018 Agenda 1. Triangulation. No book, the slides are the curriculum 2. Finding the convex hull. Textbook, 8.6.2 2 Triangulation and terrain models Here we have

More information

The angle measure at for example the vertex A is denoted by m A, or m BAC.

The angle measure at for example the vertex A is denoted by m A, or m BAC. MT 200 ourse notes on Geometry 5 2. Triangles and congruence of triangles 2.1. asic measurements. Three distinct lines, a, b and c, no two of which are parallel, form a triangle. That is, they divide the

More information

Similarity - Using Mirrors to Find Heights

Similarity - Using Mirrors to Find Heights Similarity - Using Mirrors to Find Heights AUTHOR(S): DANA SHAMIR TEACH # 2 MENTOR: NANNETTE STRICKLAND DATE TO BE TAUGHT: 11/29/2007 LENGTH OF LESSON: 45 MINUTES GRADE LEVEL: 8 SOURCE OF THE LESSON: Connecting

More information

Iterated Functions Systems and Fractal Coding

Iterated Functions Systems and Fractal Coding Qing Jun He 90121047 Math 308 Essay Iterated Functions Systems and Fractal Coding 1. Introduction Fractal coding techniques are based on the theory of Iterated Function Systems (IFS) founded by Hutchinson

More information

Interactive Graphics. Lecture 9: Introduction to Spline Curves. Interactive Graphics Lecture 9: Slide 1

Interactive Graphics. Lecture 9: Introduction to Spline Curves. Interactive Graphics Lecture 9: Slide 1 Interactive Graphics Lecture 9: Introduction to Spline Curves Interactive Graphics Lecture 9: Slide 1 Interactive Graphics Lecture 13: Slide 2 Splines The word spline comes from the ship building trade

More information

CS-184: Computer Graphics

CS-184: Computer Graphics CS-184: Computer Graphics Lecture #12: Curves and Surfaces Prof. James O Brien University of California, Berkeley V2007-F-12-1.0 Today General curve and surface representations Splines and other polynomial

More information

Week 9: Planar and non-planar graphs. 7 and 9 November, 2018

Week 9: Planar and non-planar graphs. 7 and 9 November, 2018 (1/27) MA284 : Discrete Mathematics Week 9: Planar and non-planar graphs http://www.maths.nuigalway.ie/ niall/ma284/ 7 and 9 November, 2018 1 Planar graphs and Euler s formula 2 Non-planar graphs K 5 K

More information

Terrain Generation Using Delaunay Triangulation and Image Analysis

Terrain Generation Using Delaunay Triangulation and Image Analysis Terrain Generation Using Delaunay Triangulation and Image Analysis Brian Truhlar Abstract When artists want to create a 3d mesh that is influenced by a height map, it is usually done through a manual process

More information

UNM - PNM STATEWIDE MATHEMATICS CONTEST XLI. February 7, 2009 Second Round Three Hours

UNM - PNM STATEWIDE MATHEMATICS CONTEST XLI. February 7, 2009 Second Round Three Hours UNM - PNM STATEWIDE MATHEMATICS CONTEST XLI February 7, 009 Second Round Three Hours (1) An equilateral triangle is inscribed in a circle which is circumscribed by a square. This square is inscribed in

More information

Geometry Assessment. Eligible Texas Essential Knowledge and Skills

Geometry Assessment. Eligible Texas Essential Knowledge and Skills Geometry Assessment Eligible Texas Essential Knowledge and Skills STAAR Geometry Assessment Reporting Category 1: Geometric Structure The student will demonstrate an understanding of geometric structure.

More information

Module 1 Lecture Notes 2. Optimization Problem and Model Formulation

Module 1 Lecture Notes 2. Optimization Problem and Model Formulation Optimization Methods: Introduction and Basic concepts 1 Module 1 Lecture Notes 2 Optimization Problem and Model Formulation Introduction In the previous lecture we studied the evolution of optimization

More information

4.2 and 4.6 filled in notes.notebook. December 08, Integration. Copyright Cengage Learning. All rights reserved.

4.2 and 4.6 filled in notes.notebook. December 08, Integration. Copyright Cengage Learning. All rights reserved. 4 Integration Copyright Cengage Learning. All rights reserved. 1 4.2 Area Copyright Cengage Learning. All rights reserved. 2 Objectives Use sigma notation to write and evaluate a sum. Understand the concept

More information

ECE 600, Dr. Farag, Summer 09

ECE 600, Dr. Farag, Summer 09 ECE 6 Summer29 Course Supplements. Lecture 4 Curves and Surfaces Aly A. Farag University of Louisville Acknowledgements: Help with these slides were provided by Shireen Elhabian A smile is a curve that

More information

Types of obstacles in chain Surveying

Types of obstacles in chain Surveying Types of obstacles in chain Surveying http://wikienvironment.org Types of obstacles in chain Surveying and Solutions of obstacles in chain Surveying: Sometimes it will be observed that many obstructions

More information

Higher tier unit 6a check in test. Calculator

Higher tier unit 6a check in test. Calculator Higher tier unit 6a check in test Calculator Q1. The point A has coordinates (2, 3). The point B has coordinates (6, 8). M is the midpoint of the line AB. Find the coordinates of M. Q2. The points A, B

More information

Fractals. Materials. Pencil Paper Grid made of triangles

Fractals. Materials. Pencil Paper Grid made of triangles Fractals Overview: Fractals are new on the mathematics scene, however they are in your life every day. Cell phones use fractal antennas, doctors study fractal-based blood flow diagrams to search for cancerous

More information

A triangle ( ) is the union of three segments determined by three noncollinear points.

A triangle ( ) is the union of three segments determined by three noncollinear points. Chapter 6 Triangles A triangle ( ) is the union of three segments determined by three noncollinear points. C Each of the three points, A, B and C is a vertex of the triangle. A B AB, BC, and AC are called

More information

Week - 04 Lecture - 01 Merge Sort. (Refer Slide Time: 00:02)

Week - 04 Lecture - 01 Merge Sort. (Refer Slide Time: 00:02) Programming, Data Structures and Algorithms in Python Prof. Madhavan Mukund Department of Computer Science and Engineering Indian Institute of Technology, Madras Week - 04 Lecture - 01 Merge Sort (Refer

More information

ME 111: Engineering Drawing. Geometric Constructions

ME 111: Engineering Drawing. Geometric Constructions ME 111: Engineering Drawing Lecture 2 01-08-2011 Geometric Constructions Indian Institute of Technology Guwahati Guwahati 781039 Geometric Construction Construction of primitive geometric forms (points,

More information

Unit 1, Lesson 11: Polygons

Unit 1, Lesson 11: Polygons Unit 1, Lesson 11: Polygons Lesson Goals Understand and explain that one can find the area of any polygon by decomposing and rearranging it into rectangles and triangles. Understand the defining characteristics

More information

08 - Designing Approximating Curves

08 - Designing Approximating Curves 08 - Designing Approximating Curves Acknowledgement: Olga Sorkine-Hornung, Alexander Sorkine-Hornung, Ilya Baran Last time Interpolating curves Monomials Lagrange Hermite Different control types Polynomials

More information

Maths. Formative Assessment/key piece of work prior to end of unit: Term Autumn 1

Maths. Formative Assessment/key piece of work prior to end of unit: Term Autumn 1 Term Autumn 1 3 weeks Negative numbers Multiples and factors Common factors Prime numbers Ordering decimal numbers Rounding Square numbers and square roots Prime factor decomposition LCM and HCF Square

More information

DOWNLOAD PDF BIG IDEAS MATH VERTICAL SHRINK OF A PARABOLA

DOWNLOAD PDF BIG IDEAS MATH VERTICAL SHRINK OF A PARABOLA Chapter 1 : BioMath: Transformation of Graphs Use the results in part (a) to identify the vertex of the parabola. c. Find a vertical line on your graph paper so that when you fold the paper, the left portion

More information

QUADRATIC AND CUBIC GRAPHS

QUADRATIC AND CUBIC GRAPHS NAME SCHOOL INDEX NUMBER DATE QUADRATIC AND CUBIC GRAPHS KCSE 1989 2012 Form 3 Mathematics Working Space 1. 1989 Q22 P1 (a) Using the grid provided below draw the graph of y = -2x 2 + x + 8 for values

More information

Week 9: Planar and non-planar graphs. 1st and 3rd of November, 2017

Week 9: Planar and non-planar graphs. 1st and 3rd of November, 2017 (1/26) MA284 : Discrete Mathematics Week 9: Planar and non-planar graphs http://www.maths.nuigalway.ie/~niall/ma284/ 1st and 3rd of November, 2017 1 Recall... planar graphs and Euler s formula 2 Non-planar

More information

Roadmap for tonight. What are Bezier curves (mathematically)? Programming Bezier curves (very high level view).

Roadmap for tonight. What are Bezier curves (mathematically)? Programming Bezier curves (very high level view). Roadmap for tonight Some background. What are Bezier curves (mathematically)? Characteristics of Bezier curves. Demo. Programming Bezier curves (very high level view). Why Bezier curves? Bezier curves

More information

Mathematical Operations

Mathematical Operations CHAPTER 10 Mathematical Operations The basic approach for the problems of this type is more or less similar to that of coding and decoding. One has to study the symbols or the geometrical figures and their

More information

February 23 Math 2335 sec 51 Spring 2016

February 23 Math 2335 sec 51 Spring 2016 February 23 Math 2335 sec 51 Spring 2016 Section 4.1: Polynomial Interpolation Interpolation is the process of finding a curve or evaluating a function whose curve passes through a known set of points.

More information

Skill: Polygons. Vocabulary: Polygon a closed two-dimensional figure with straight edges

Skill: Polygons. Vocabulary: Polygon a closed two-dimensional figure with straight edges Skill: Polygons Standard: 5.13.a ~ The student, using plane figures (square, rectangle, triangle, parallelogram, rhombus, and trapezoid), will develop definitions of these plane figures; 5.13.b ~ The student,

More information

Measurement and Geometry: Area and Volume of Geometric Figures and Objects *

Measurement and Geometry: Area and Volume of Geometric Figures and Objects * OpenStax-CNX module: m35023 1 Measurement and Geometry: and Volume of Geometric Figures and Objects * Wade Ellis Denny Burzynski This work is produced by OpenStax-CNX and licensed under the Creative Commons

More information

Let s use a more formal definition. An angle is the union of two rays with a common end point.

Let s use a more formal definition. An angle is the union of two rays with a common end point. hapter 2 ngles What s the secret for doing well in geometry? Knowing all the angles. s we did in the last chapter, we will introduce new terms and new notations, the building blocks for our success. gain,

More information

Rendering Curves and Surfaces. Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico

Rendering Curves and Surfaces. Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico Rendering Curves and Surfaces Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico Objectives Introduce methods to draw curves - Approximate

More information

(Refer Slide Time: 00:02:24 min)

(Refer Slide Time: 00:02:24 min) CAD / CAM Prof. Dr. P. V. Madhusudhan Rao Department of Mechanical Engineering Indian Institute of Technology, Delhi Lecture No. # 9 Parametric Surfaces II So these days, we are discussing the subject

More information

Section 1: Introduction to Geometry Points, Lines, and Planes

Section 1: Introduction to Geometry Points, Lines, and Planes Section 1: Introduction to Geometry Points, Lines, and Planes Topic 1: Basics of Geometry - Part 1... 3 Topic 2: Basics of Geometry Part 2... 5 Topic 3: Midpoint and Distance in the Coordinate Plane Part

More information

And Now From a New Angle Special Angles and Postulates LEARNING GOALS

And Now From a New Angle Special Angles and Postulates LEARNING GOALS And Now From a New Angle Special Angles and Postulates LEARNING GOALS KEY TERMS. In this lesson, you will: Calculate the complement and supplement of an angle. Classify adjacent angles, linear pairs, and

More information