MA 323 Geometric Modelling Course Notes: Day 17 Bezier Splines I
|
|
- Priscilla Reeves
- 7 years ago
- Views:
Transcription
1 MA 323 Geometric Modelling Course Notes: Day 17 Bezier Splines I David L. Finn Today, we start considering piecewise Bezier curves or Bezier splines. We have previously introduced the idea of piecewise polynomial curves (Hermite curves), which was a direct generalization of piecewise linear curves (polylines) and piecewise circular curves. We now want to extend the idea of piecewise polynomial curves to Bezier curves, and introduce the idea of a composite Bezier curve or a Bezier spline. The word spline comes from naval architecture when knots, ropes and pulleys were used to bend the wooden planks that were used to build wooden ships. In fact, much of the terminology involved with splines comes from the physical constructions of naval architecture. When constructing splines, it is typically done with respect to a smoothness condition. There are two types of smoothness that are considered, functional and geometric. These involve different notions of continuity. Functional continuity involves orders of continuity with respect to the parameter of the curve, while geometric continuity involves continuity with respect to the arc-length parameter of the curve. Today and tomorrow, we will only consider splines with respect to functional continuity. To look at geometric continuity, we need to look in more detail at the differential geometry of curves Piecewise Bezier Curves We define a piecewise Bezier curve by giving two (or more) sets of control points. Let p 1 0, p 1 1, p 1 2,, p 1 n be one set of control points and p 2 0, p 2 1, p 2 2,, p 2 n be another set of control points. [It is convention that one joins curves of the same order, as using degree elevation we can always arrange the curves to have the same degree.] We can use each set to define a Bezier curve, let b 1 (t) be the curve with control points {p 1 i } and let b 2(t) be the curve with control points {p 2 j }. We can then define a piecewise Bezier curve by { b 1 (s) if 0 s 1 b(s) = b 2 (s 1) if 1 s 2 We must define the curve in this manner so for each value of s we get back one point. We note that there is a slight problem with this definition. When t = 1, this curve is possibly multi-valued, depending on the values of the last control point of b 1 (t) and the first control point of b 2 (t), that is p 1 n and p 2 0. The parameter t for each Bezier curve b i (t) is a local parameter, used to construct the Bezier curve, while the parameter s defining the piecewise Bezier curve is a global parameter. Notice that a piecewise Bezier curve as defined above is continuous if and only if p 1 n = p 2 0. This is due to the endpoint interpolation property for Bezier curves, and in this case the curve is single valued. When p 1 n p 2 0, a Bezier curve as defined above is not continuous and
2 17-2 the definition is not single-valued. A piecewise Bezier curve that is continuous (p 1 n = p 2 0) is said to have zeroth order continuity. Higher orders of functional continuity are defined by continuity of the derivatives of the curve at the joint point p 1 n = p 2 0. Figure 1: A piecewise Bezier curve consisting of 4 cubic curves In the diagram above, notice that there is a sharp corner where the first and second arcs are joined and there is a sharp corner where the three and fourth arcs are joined, but there is no apparent corner where the second and third arcs are joined. Even though the individual Bezier curves are smooth, piecewise Bezier curves do not have to be smooth. At the joint p 1 n = p 2 0, the piecewise Bezier curve can have a sharp corner as illustrated in the diagram above. To define a piecewise Bezier curve, so that it does not have a sharp corner, we consider the value of the derivative for each curve at the joint p i (1) = pi + 1(0) (using the uniform knot sequence see below), the values of the derivatives p i (1) and p i+1 (0). Recall from the previous notes that the derivative of a Bezier curve is the Bezier curve b(t) = i=0 n Bi n (t) p i i=0 n 1 b (t) = n B n 1 i (t) i p, where i p = p i+1 p i are the first differences of the control points. Therefore using a uniform knot sequence that is t 0 = 0, t 1 = 1, t 2 = 2 et cetera, we have that b 1(1) = n (p 1 n p 1 n 1) = n (p 2 1 p 2 0) = p 2(0) from B n 0 (0) = 1 and B n i (0) = 0 if i > 0, and Bn i (1) = 0 if i < n and Bn n(1) = 1. We thus conclude from p 2 0 = p 1 n that p 2 0 = p 1 n = 1 2 (p1 n 1 + p 2 1). Therefore, to construct a piecewise Bezier curve using two curves we give n points for each curve, and define the joint point as
3 17-3 the midpoint of the the segment p 1 n 1 and p 2 1. An example of such a joining of two Bezier curves to produce a piecewise defined Bezier curve is given below. Figure 2: Construction of cubic C 1 Bezier spline of two segments The procedure above generalizes to construct C 1 Bezier splines. For the remainder of this chapter we will mainly consider piecewise cubic Bezier curves, which we will consider in detail in the next section. But first, we note that there is no reason that we have to use 0 t 1 as the interval over which the first Bezier curve is defined and there is no reason that we have to use 1 t 2 as the interval over which the second Bezier curve is defined. We can instead define the composite curve over the arbitrary subintervals. This is an important observation that will be exploited when defining B-splines and is important in animation, at it allows one to use time explicitly in controlling the motion and designing the path of the motion. To define a piecewise Bezier curve, we thus technically require in addition to control points a knot sequence t 0 < t 1 < t 2 < < t L where L is the number of arcs used to create the piecewise Bezier curve. The knot sequence t 0 = 0, t 1 = 1,, t L = L is called the uniform knot sequence, and if no knot sequence is given you are to assume that the uniform knot sequence is used in creating a piecewise Bezier curve. To create a Bezier curve using a nonuniform knot sequence, we first consider the linear transformation that maps the interval t 0 t t 1 to 0 τ 1, that is τ = (t t 0 )/(t 1 t 0 ). We then use (t t 0 )/(t 1 t 0 ) as the parameter in the Bernstein polynomials defining the Bezier curve, to define the curve c 1 (t) can be defined as c 1 (t) = n i=0 B n i ( ) t t0 t 1 t 0 p 1 i = b 1 ( t t 0 t 1 t 0 ), where b 1 is the Bezier curve with control points {p 1 i }. The second arc of the piecewise Bezier
4 17-4 curve is likewise defined as c 2 (t) = n i=0 B n i ( ) t t1 t 2 t 1 p 2 i = b 2 ( t t 1 t 2 t 1 ). This can be extended to other other arcs defined on t i t t i+1 in the obvious manner. We note the parameterization of the curve has no affect on the zeroth order continuity of a piecewise Bezier curve. The equality of the first and last control points determine the zeroth order continuity. In fact, the fact that c i (t) = b i ((t t i 1 )/(t i t i 1 )) implies that the parameterization of a piecewise Bezier curve has no affect on the shape of the curve, since τ(t) = (t t i 1 )/(t i t i 1 ) is a one-to-one and onto function from [t i 1, t i ] to [0, 1], and there is a inverse t = t i 1 + τ(t i t i 1 ). Reparameterizations of a curve in general have no affect on the shape of curve, but can affect the smoothness of the curve as you are to demonstrate in one of the exercises. Exercises 1. Play with the applet: Creating C 0 Bezier Splines. This applet uses the uniform knot sequence, as the knot sequence has no affect on the curve. 2. Where do you place the control points to approximate a circle with a C 0 Bezier spline? Use the Applet: Fitting a C 0 Bezier spline to a circle to investigate this. How does the number of segments change the configuration of the control points and the control polyline? 3. Given the control polyline below sketch the C 0 cubic Bezier spline. Figure 3: Construct C 0 cubic Bezier spline
5 Given the control points below, determine if the C 0 cubic Bezier spline will be differentiable with the uniform knot sequence. Figure 4: Is this C 0 Bezier spline differentiable? 5. Determine the conditions required for a piecewise Bezier curve with two cubic curves with control points p k 0, p k 1, p k 2 and p k 3 (k = 1 or k = 2) using the nonuniform knot sequence t 0, t 1, t 2 to be C 1, that is have a continuous derivative at the joint point p 1 3 = p 2 0. This means compute b 1(t 1 ) and b 2(t 1 ) where b 1 (t) = B 3 i ((t t 0)/(t 1 t 0 )) p 1 i and b 2 (t) = B 3 i ((t t 1)/(t 2 t 1 )) p 2 i, and determine the relations between p1 2, p 1 3 = p 2 0, p C 1 cubic Bezier Splines We now start considering curves that truly are Bezier splines. Our principal interest in this section is with C 1 cubic Bezier splines. Cubic Bezier splines are of special interest as they allow us to define and approximate curves very well with simple curves. The approximation of a circle by using cubic curves to approximate a quarter circle in the interactive exercises is a simple example of the use of cubic Bezier splines. Let us start by considering, a piecewise Bezier curve consisting of three cubic Bezier curves. To define this piecewise curve, we need 10 control points. Each cubic curve requires 4 points for a total of 12 points, but there are two joint points, meaning we need 10 control points. If we desire the curve to smooth at the joint points, we really only need 8 control points, as the joint points are defined by the two nearest points. The first three control points of the first cubic curve segment, the last three control points of the third cubic curve segment, and the middle two control points of the second curve segment, see the diagram below. In general, we need to be given 2L + 2 points to define a C 1 cubic Bezier spline (with the uniform knot sequence) that is made up of L cubic Bezier arcs. This is an advantage over the number of points that must be given to create a C 0 cubic Bezier spline, as 3L + 1 points need to be given to create a C 0 cubic Bezier spline. The exact procedure for producing the Bezier spline is given below. We start with the spline control points d 1, d 0, d 1,, d 2L. [The index in defining the spline control points begins at 1 so that the last spline control
6 17-6 Figure 5: A differentiable piecewise Bezier curve of three segments point is given by 2L from which it is easy to determine the number of curve segments.] To produce, the L cubic Bezier curves we need 4L control points, however since the spline is to be continuous L 1 of these points are joints (the points where consecutive cubic curves meet), that means we really need to define 3L + 1 control points from the 2L + 2 spline control points. From the 3L + 1 control points p 0, p 1, p 2,, p 3L, we define the individual cubic Bezier curves b j (t) with j = 1, 2,, L as b j (t) = (1 t) 3 p 3j 3 + 3t(1 t) 2 p 3j 2 + 3t 2 (1 t) p 3j 1 + t 3 p j The procedure for defining the control points p i from the given control points d 1, d 0, d 1,, d 2L and a uniform knot sequence is to set p 0 = d 1 p 1 = d 0 p 2 = d 1 to start the definition of the control points of the Bezier curves. Then we define, p 3i+1 = d 2i and p 3i+2 = d 2i+1 for i = 1, 2,, L 1. This gives the middle two points of each intermediate Bezier curve, and all but the final point in the last Bezier curve. We then define p 3L = d 2L (the last control point in defining the piecewise Bezier curve = the last control point in the Bezier spline), and then we define p 3i = 1 2 (p 3i 1 + p 3i+1 ) with i = 1, 2,, L 1, which gives the joint points of the Bezier curves. See diagram, below. To use a nonuniform knot sequence, the points p 3i where two cubic Bezier curves meet in the spline no longer need to be at the midpoint of the segment p 3i 1 and p 3i+1 that are defined
7 17-7 Figure 6: A C 1 Bezier spline of 4 segments with its spline control points. directly from the control points d k. It does have to be on the line segment p 3i 1 p 3i+1 but not necessarily at the midpoint. The exact location is determined by the knot sequence, see exercises below. Exercises 1. Play with the applet: Creating C 1 (cubic) Bezier Splines. Notice the difference between a C 1 Bezier spline and the Bezier curve with the same control points. In particular, play with how the control points affect the shape of the curve. This applet uses uniform knot sequences. 2. Where do you place the control points to approximate a circle with a C 1 Bezier spline? Use the Applet: Fitting a C 1 Bezier spline to a circle to investigate this. How does the number of segments change the configuration of the control points and the control polyline? 3. Determine the algorithm to create an nth degree C 1 Bezier spline, a piecewise Bezier curve consisting of nth order Bezier curves. 4. Extend the conditions from Exercise 4 in the previous subsection to define a cubic Bezier spline with L cubic arcs and a nonuniform knot sequence. 5. Determine the conditions relating the control points of an nth degree C 1 Bezier spline to the associated piecewise Bezier curve using a non-uniform knot sequence. 6. Sketch the C 1 Bezier spline given the control polylines below (assuming a uniform) sequence
8 17-8 Figure 7: Sketch the C 1 Bezier spline given the control polyline Figure 8: Sketch the C 1 Bezier spline given the control polyline
MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem
MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem David L. Finn November 30th, 2004 In the next few days, we will introduce some of the basic problems in geometric modelling, and
More informationCSE 167: Lecture 13: Bézier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2011
CSE 167: Introduction to Computer Graphics Lecture 13: Bézier Curves Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2011 Announcements Homework project #6 due Friday, Nov 18
More informationComputer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science - Technion. An Example.
An Example 2 3 4 Outline Objective: Develop methods and algorithms to mathematically model shape of real world objects Categories: Wire-Frame Representation Object is represented as as a set of points
More informationthe points are called control points approximating curve
Chapter 4 Spline Curves A spline curve is a mathematical representation for which it is easy to build an interface that will allow a user to design and control the shape of complex curves and surfaces.
More information(Refer Slide Time: 1:42)
Introduction to Computer Graphics Dr. Prem Kalra Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture - 10 Curves So today we are going to have a new topic. So far
More informationFigure 2.1: Center of mass of four points.
Chapter 2 Bézier curves are named after their inventor, Dr. Pierre Bézier. Bézier was an engineer with the Renault car company and set out in the early 196 s to develop a curve formulation which would
More informationCHAPTER 1 Splines and B-splines an Introduction
CHAPTER 1 Splines and B-splines an Introduction In this first chapter, we consider the following fundamental problem: Given a set of points in the plane, determine a smooth curve that approximates the
More informationGeometric Modelling & Curves
Geometric Modelling & Curves Geometric Modeling Creating symbolic models of the physical world has long been a goal of mathematicians, scientists, engineers, etc. Recently technology has advanced sufficiently
More informationWe can display an object on a monitor screen in three different computer-model forms: Wireframe model Surface Model Solid model
CHAPTER 4 CURVES 4.1 Introduction In order to understand the significance of curves, we should look into the types of model representations that are used in geometric modeling. Curves play a very significant
More informationNovember 16, 2015. Interpolation, Extrapolation & Polynomial Approximation
Interpolation, Extrapolation & Polynomial Approximation November 16, 2015 Introduction In many cases we know the values of a function f (x) at a set of points x 1, x 2,..., x N, but we don t have the analytic
More information1 Cubic Hermite Spline Interpolation
cs412: introduction to numerical analysis 10/26/10 Lecture 13: Cubic Hermite Spline Interpolation II Instructor: Professor Amos Ron Scribes: Yunpeng Li, Mark Cowlishaw, Nathanael Fillmore 1 Cubic Hermite
More informationModeling Curves and Surfaces
Modeling Curves and Surfaces Graphics I Modeling for Computer Graphics!? 1 How can we generate this kind of objects? Umm!? Mathematical Modeling! S Do not worry too much about your difficulties in mathematics,
More information3. Interpolation. Closing the Gaps of Discretization... Beyond Polynomials
3. Interpolation Closing the Gaps of Discretization... Beyond Polynomials Closing the Gaps of Discretization... Beyond Polynomials, December 19, 2012 1 3.3. Polynomial Splines Idea of Polynomial Splines
More informationEECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines
EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation
More informationEssential Mathematics for Computer Graphics fast
John Vince Essential Mathematics for Computer Graphics fast Springer Contents 1. MATHEMATICS 1 Is mathematics difficult? 3 Who should read this book? 4 Aims and objectives of this book 4 Assumptions made
More informationCorollary. (f є C n+1 [a,b]). Proof: This follows directly from the preceding theorem using the inequality
Corollary For equidistant knots, i.e., u i = a + i (b-a)/n, we obtain with (f є C n+1 [a,b]). Proof: This follows directly from the preceding theorem using the inequality 120202: ESM4A - Numerical Methods
More information88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a
88 CHAPTER. VECTOR FUNCTIONS.4 Curvature.4.1 Definitions and Examples The notion of curvature measures how sharply a curve bends. We would expect the curvature to be 0 for a straight line, to be very small
More informationParametric Curves. (Com S 477/577 Notes) Yan-Bin Jia. Oct 8, 2015
Parametric Curves (Com S 477/577 Notes) Yan-Bin Jia Oct 8, 2015 1 Introduction A curve in R 2 (or R 3 ) is a differentiable function α : [a,b] R 2 (or R 3 ). The initial point is α[a] and the final point
More informationBEZIER CURVES AND SURFACES
Department of Applied Mathematics and Computational Sciences University of Cantabria UC-CAGD Group COMPUTER-AIDED GEOMETRIC DESIGN AND COMPUTER GRAPHICS: BEZIER CURVES AND SURFACES Andrés Iglesias e-mail:
More informationComputer Graphics CS 543 Lecture 12 (Part 1) Curves. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)
Computer Graphics CS 54 Lecture 1 (Part 1) Curves Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) So Far Dealt with straight lines and flat surfaces Real world objects include
More informationTrigonometric Functions and Equations
Contents Trigonometric Functions and Equations Lesson 1 Reasoning with Trigonometric Functions Investigations 1 Proving Trigonometric Identities... 271 2 Sum and Difference Identities... 276 3 Extending
More informationCurves and Surfaces. Goals. How do we draw surfaces? How do we specify a surface? How do we approximate a surface?
Curves and Surfaces Parametric Representations Cubic Polynomial Forms Hermite Curves Bezier Curves and Surfaces [Angel 10.1-10.6] Goals How do we draw surfaces? Approximate with polygons Draw polygons
More information1 Review of Least Squares Solutions to Overdetermined Systems
cs4: introduction to numerical analysis /9/0 Lecture 7: Rectangular Systems and Numerical Integration Instructor: Professor Amos Ron Scribes: Mark Cowlishaw, Nathanael Fillmore Review of Least Squares
More informationTWO-DIMENSIONAL TRANSFORMATION
CHAPTER 2 TWO-DIMENSIONAL TRANSFORMATION 2.1 Introduction As stated earlier, Computer Aided Design consists of three components, namely, Design (Geometric Modeling), Analysis (FEA, etc), and Visualization
More informationPolynomials. Dr. philippe B. laval Kennesaw State University. April 3, 2005
Polynomials Dr. philippe B. laval Kennesaw State University April 3, 2005 Abstract Handout on polynomials. The following topics are covered: Polynomial Functions End behavior Extrema Polynomial Division
More informationTraditional Drawing Tools
Engineering Drawing Traditional Drawing Tools DRAWING TOOLS DRAWING TOOLS 1. T-Square 2. Triangles DRAWING TOOLS HB for thick line 2H for thin line 3. Adhesive Tape 4. Pencils DRAWING TOOLS 5. Sandpaper
More informationDegree Reduction of Interval SB Curves
International Journal of Video&Image Processing and Network Security IJVIPNS-IJENS Vol:13 No:04 1 Degree Reduction of Interval SB Curves O. Ismail, Senior Member, IEEE Abstract Ball basis was introduced
More informationComputer Animation: Art, Science and Criticism
Computer Animation: Art, Science and Criticism Tom Ellman Harry Roseman Lecture 4 Parametric Curve A procedure for distorting a straight line into a (possibly) curved line. The procedure lives in a black
More informationPiecewise Cubic Splines
280 CHAP. 5 CURVE FITTING Piecewise Cubic Splines The fitting of a polynomial curve to a set of data points has applications in CAD (computer-assisted design), CAM (computer-assisted manufacturing), and
More informationProblem of the Month: Once Upon a Time
Problem of the Month: The Problems of the Month (POM) are used in a variety of ways to promote problem solving and to foster the first standard of mathematical practice from the Common Core State Standards:
More informationNatural cubic splines
Natural cubic splines Arne Morten Kvarving Department of Mathematical Sciences Norwegian University of Science and Technology October 21 2008 Motivation We are given a large dataset, i.e. a function sampled
More informationMATH 132: CALCULUS II SYLLABUS
MATH 32: CALCULUS II SYLLABUS Prerequisites: Successful completion of Math 3 (or its equivalent elsewhere). Math 27 is normally not a sufficient prerequisite for Math 32. Required Text: Calculus: Early
More information2. Length and distance in hyperbolic geometry
2. Length and distance in hyperbolic geometry 2.1 The upper half-plane There are several different ways of constructing hyperbolic geometry. These different constructions are called models. In this lecture
More informationPARAMETRIC MODELING. David Rosen. December 1997. By carefully laying-out datums and geometry, then constraining them with dimensions and constraints,
1 of 5 11/18/2004 6:24 PM PARAMETRIC MODELING David Rosen December 1997 The term parametric modeling denotes the use of parameters to control the dimensions and shape of CAD models. Think of a rubber CAD
More informationHow To Use Design Mentor
DesignMentor: A Pedagogical Tool for Computer Graphics and Computer Aided Design John L. Lowther and Ching Kuang Shene Programmers: Yuan Zhao and Yan Zhou (ver 1) Budirijanto Purnomo (ver 2) Michigan Technological
More informationA matrix method for degree-raising of B-spline curves *
VOI. 40 NO. 1 SCIENCE IN CHINA (Series E) February 1997 A matrix method for degree-raising of B-spline curves * QIN Kaihuai (%*>/$) (Department of Computer Science and Technology, Tsinghua University,
More informationObjectives. Materials
Activity 4 Objectives Understand what a slope field represents in terms of Create a slope field for a given differential equation Materials TI-84 Plus / TI-83 Plus Graph paper Introduction One of the ways
More informationGraphical Integration Exercises Part Four: Reverse Graphical Integration
D-4603 1 Graphical Integration Exercises Part Four: Reverse Graphical Integration Prepared for the MIT System Dynamics in Education Project Under the Supervision of Dr. Jay W. Forrester by Laughton Stanley
More informationEstimating the Average Value of a Function
Estimating the Average Value of a Function Problem: Determine the average value of the function f(x) over the interval [a, b]. Strategy: Choose sample points a = x 0 < x 1 < x 2 < < x n 1 < x n = b and
More informationCATIA Wireframe & Surfaces TABLE OF CONTENTS
TABLE OF CONTENTS Introduction... 1 Wireframe & Surfaces... 2 Pull Down Menus... 3 Edit... 3 Insert... 4 Tools... 6 Generative Shape Design Workbench... 7 Bottom Toolbar... 9 Tools... 9 Analysis... 10
More informationINTERPOLATION. Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y).
INTERPOLATION Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y). As an example, consider defining and x 0 =0, x 1 = π 4, x
More informationFinite Element Formulation for Plates - Handout 3 -
Finite Element Formulation for Plates - Handout 3 - Dr Fehmi Cirak (fc286@) Completed Version Definitions A plate is a three dimensional solid body with one of the plate dimensions much smaller than the
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationOverview of Data Fitting Component in Intel Math Kernel Library (Intel MKL) Intel Corporation
Overview of Data Fitting Component in Intel Math Kernel Library (Intel MKL) Intel Corporation Agenda 1D interpolation problem statement Computation flow Application areas Data fitting in Intel MKL Data
More informationPERFORMANCE OF BÉZIER CURVES RENDERING IN WEB BROWSERS
PERFORMANCE OF BÉZIER CURVES RENDERING IN WEB BROWSERS Abstract By Ammar Hattab APMA2821Q Project Report Prof. Mark Ainsworth Spring 2013 Brown University Bézier curves are used everywhere in graphics,
More informationExamples of Functions
Examples of Functions In this document is provided examples of a variety of functions. The purpose is to convince the beginning student that functions are something quite different than polynomial equations.
More informationPRACTICAL GUIDE TO DATA SMOOTHING AND FILTERING
PRACTICAL GUIDE TO DATA SMOOTHING AND FILTERING Ton van den Bogert October 3, 996 Summary: This guide presents an overview of filtering methods and the software which is available in the HPL.. What is
More informationChapter 2. Parameterized Curves in R 3
Chapter 2. Parameterized Curves in R 3 Def. A smooth curve in R 3 is a smooth map σ : (a, b) R 3. For each t (a, b), σ(t) R 3. As t increases from a to b, σ(t) traces out a curve in R 3. In terms of components,
More informationGrade 7 & 8 Math Circles Circles, Circles, Circles March 19/20, 2013
Faculty of Mathematics Waterloo, Ontario N2L 3G Introduction Grade 7 & 8 Math Circles Circles, Circles, Circles March 9/20, 203 The circle is a very important shape. In fact of all shapes, the circle is
More information1. Abstract 2. Introduction 3. Algorithms and Techniques
MS PROJECT Virtual Surgery Piyush Soni under the guidance of Dr. Jarek Rossignac, Brian Whited Georgia Institute of Technology, Graphics, Visualization and Usability Center Atlanta, GA piyush_soni@gatech.edu,
More informationSolidWorks Implementation Guides. Sketching Concepts
SolidWorks Implementation Guides Sketching Concepts Sketching in SolidWorks is the basis for creating features. Features are the basis for creating parts, which can be put together into assemblies. Sketch
More informationB2.53-R3: COMPUTER GRAPHICS. NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions.
B2.53-R3: COMPUTER GRAPHICS NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be answered in the TEAR-OFF ANSWER
More informationIntermediate Tutorials Modeling - Trees. 3d studio max. 3d studio max. Tree Modeling. 1.2206 2006 Matthew D'Onofrio Page 1 of 12
3d studio max Tree Modeling Techniques and Principles 1.2206 2006 Matthew D'Onofrio Page 1 of 12 Modeling Trees Tree Modeling Techniques and Principles The era of sprites and cylinders-for-trunks has passed
More information1 Review of Newton Polynomials
cs: introduction to numerical analysis 0/0/0 Lecture 8: Polynomial Interpolation: Using Newton Polynomials and Error Analysis Instructor: Professor Amos Ron Scribes: Giordano Fusco, Mark Cowlishaw, Nathanael
More informationThis week. CENG 732 Computer Animation. Challenges in Human Modeling. Basic Arm Model
CENG 732 Computer Animation Spring 2006-2007 Week 8 Modeling and Animating Articulated Figures: Modeling the Arm, Walking, Facial Animation This week Modeling the arm Different joint structures Walking
More informationChapter 4. Polynomial and Rational Functions. 4.1 Polynomial Functions and Their Graphs
Chapter 4. Polynomial and Rational Functions 4.1 Polynomial Functions and Their Graphs A polynomial function of degree n is a function of the form P = a n n + a n 1 n 1 + + a 2 2 + a 1 + a 0 Where a s
More informationChapter 13: Fibonacci Numbers and the Golden Ratio
Chapter 13: Fibonacci Numbers and the Golden Ratio 13.1 Fibonacci Numbers THE FIBONACCI SEQUENCE 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, The sequence of numbers shown above is called the Fibonacci
More informationAn Instructional Aid System for Driving Schools Based on Visual Simulation
An Instructional Aid System for Driving Schools Based on Visual Simulation Salvador Bayarri, Rafael Garcia, Pedro Valero, Ignacio Pareja, Institute of Traffic and Road Safety (INTRAS), Marcos Fernandez
More informationCore Maths C2. Revision Notes
Core Maths C Revision Notes November 0 Core Maths C Algebra... Polnomials: +,,,.... Factorising... Long division... Remainder theorem... Factor theorem... 4 Choosing a suitable factor... 5 Cubic equations...
More informationComputational Geometry. Lecture 1: Introduction and Convex Hulls
Lecture 1: Introduction and convex hulls 1 Geometry: points, lines,... Plane (two-dimensional), R 2 Space (three-dimensional), R 3 Space (higher-dimensional), R d A point in the plane, 3-dimensional space,
More informationThnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks
Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks Welcome to Thinkwell s Homeschool Precalculus! We re thrilled that you ve decided to make us part of your homeschool curriculum. This lesson
More informationCOMMON CORE STATE STANDARDS FOR MATHEMATICS 3-5 DOMAIN PROGRESSIONS
COMMON CORE STATE STANDARDS FOR MATHEMATICS 3-5 DOMAIN PROGRESSIONS Compiled by Dewey Gottlieb, Hawaii Department of Education June 2010 Operations and Algebraic Thinking Represent and solve problems involving
More informationBlender 3D Animation
Bachelor Maths/Physics/Computer Science University Paris-Sud Digital Imaging Course Blender 3D Animation Christian Jacquemin Introduction to Computer Animation Animation Basics animation consists in changing
More informationLargest Fixed-Aspect, Axis-Aligned Rectangle
Largest Fixed-Aspect, Axis-Aligned Rectangle David Eberly Geometric Tools, LLC http://www.geometrictools.com/ Copyright c 1998-2016. All Rights Reserved. Created: February 21, 2004 Last Modified: February
More informationALGEBRA. sequence, term, nth term, consecutive, rule, relationship, generate, predict, continue increase, decrease finite, infinite
ALGEBRA Pupils should be taught to: Generate and describe sequences As outcomes, Year 7 pupils should, for example: Use, read and write, spelling correctly: sequence, term, nth term, consecutive, rule,
More informationBy the end of this set of exercises, you should be able to:
BASIC GEOMETRIC PROPERTIES By the end of this set of exercises, you should be able to: find the area of a simple composite shape find the volume of a cube or a cuboid find the area and circumference of
More information1 The Brownian bridge construction
The Brownian bridge construction The Brownian bridge construction is a way to build a Brownian motion path by successively adding finer scale detail. This construction leads to a relatively easy proof
More informationEstimated Pre Calculus Pacing Timeline
Estimated Pre Calculus Pacing Timeline 2010-2011 School Year The timeframes listed on this calendar are estimates based on a fifty-minute class period. You may need to adjust some of them from time to
More informationIn mathematics, there are four attainment targets: using and applying mathematics; number and algebra; shape, space and measures, and handling data.
MATHEMATICS: THE LEVEL DESCRIPTIONS In mathematics, there are four attainment targets: using and applying mathematics; number and algebra; shape, space and measures, and handling data. Attainment target
More informationA Multi Level Sketching Tool for Pencil and Paper Animation
From: AAAI Technical Report SS-02-08. Compilation copyright 2002, AAAI (www.aaai.org). All rights reserved. A Multi Level Sketching Tool for Pencil and Paper Animation Fabian Di Fiore and Frank Van Reeth
More informationPrecalculus REVERSE CORRELATION. Content Expectations for. Precalculus. Michigan CONTENT EXPECTATIONS FOR PRECALCULUS CHAPTER/LESSON TITLES
Content Expectations for Precalculus Michigan Precalculus 2011 REVERSE CORRELATION CHAPTER/LESSON TITLES Chapter 0 Preparing for Precalculus 0-1 Sets There are no state-mandated Precalculus 0-2 Operations
More informationFourth Grade Math Standards and "I Can Statements"
Fourth Grade Math Standards and "I Can Statements" Standard - CC.4.OA.1 Interpret a multiplication equation as a comparison, e.g., interpret 35 = 5 x 7 as a statement that 35 is 5 times as many as 7 and
More informationMathematical Conventions Large Print (18 point) Edition
GRADUATE RECORD EXAMINATIONS Mathematical Conventions Large Print (18 point) Edition Copyright 2010 by Educational Testing Service. All rights reserved. ETS, the ETS logo, GRADUATE RECORD EXAMINATIONS,
More informationObjectives After completing this section, you should be able to:
Chapter 5 Section 1 Lesson Angle Measure Objectives After completing this section, you should be able to: Use the most common conventions to position and measure angles on the plane. Demonstrate an understanding
More informationNumerical Analysis An Introduction
Walter Gautschi Numerical Analysis An Introduction 1997 Birkhauser Boston Basel Berlin CONTENTS PREFACE xi CHAPTER 0. PROLOGUE 1 0.1. Overview 1 0.2. Numerical analysis software 3 0.3. Textbooks and monographs
More informationGiven a point cloud, polygon, or sampled parametric curve, we can use transformations for several purposes:
3 3.1 2D Given a point cloud, polygon, or sampled parametric curve, we can use transformations for several purposes: 1. Change coordinate frames (world, window, viewport, device, etc). 2. Compose objects
More information2.2 Derivative as a Function
2.2 Derivative as a Function Recall that we defined the derivative as f (a) = lim h 0 f(a + h) f(a) h But since a is really just an arbitrary number that represents an x-value, why don t we just use x
More informationGuide to Leaving Certificate Mathematics Ordinary Level
Guide to Leaving Certificate Mathematics Ordinary Level Dr. Aoife Jones Paper 1 For the Leaving Cert 013, Paper 1 is divided into three sections. Section A is entitled Concepts and Skills and contains
More informationAn Overview of the Finite Element Analysis
CHAPTER 1 An Overview of the Finite Element Analysis 1.1 Introduction Finite element analysis (FEA) involves solution of engineering problems using computers. Engineering structures that have complex geometry
More informationCharged Particle in a Magnetic Field
Charged Particle in a Magnetic Field Consider a particle moving in an external magnetic field with its velocity perpendicular to the field The force is always directed toward the center of the circular
More informationPCHS ALGEBRA PLACEMENT TEST
MATHEMATICS Students must pass all math courses with a C or better to advance to the next math level. Only classes passed with a C or better will count towards meeting college entrance requirements. If
More informationCSU Fresno Problem Solving Session. Geometry, 17 March 2012
CSU Fresno Problem Solving Session Problem Solving Sessions website: http://zimmer.csufresno.edu/ mnogin/mfd-prep.html Math Field Day date: Saturday, April 21, 2012 Math Field Day website: http://www.csufresno.edu/math/news
More informationGeometry: Unit 1 Vocabulary TERM DEFINITION GEOMETRIC FIGURE. Cannot be defined by using other figures.
Geometry: Unit 1 Vocabulary 1.1 Undefined terms Cannot be defined by using other figures. Point A specific location. It has no dimension and is represented by a dot. Line Plane A connected straight path.
More informationBPS Math Year at a Glance (Adapted from A Story Of Units Curriculum Maps in Mathematics K-5) 1
Grade 4 Key Areas of Focus for Grades 3-5: Multiplication and division of whole numbers and fractions-concepts, skills and problem solving Expected Fluency: Add and subtract within 1,000,000 Module M1:
More informationPrentice Hall Mathematics: Algebra 2 2007 Correlated to: Utah Core Curriculum for Math, Intermediate Algebra (Secondary)
Core Standards of the Course Standard 1 Students will acquire number sense and perform operations with real and complex numbers. Objective 1.1 Compute fluently and make reasonable estimates. 1. Simplify
More informationCS 4204 Computer Graphics
CS 4204 Computer Graphics Computer Animation Adapted from notes by Yong Cao Virginia Tech 1 Outline Principles of Animation Keyframe Animation Additional challenges in animation 2 Classic animation Luxo
More informationFunctions: Piecewise, Even and Odd.
Functions: Piecewise, Even and Odd. MA161/MA1161: Semester 1 Calculus. Prof. Götz Pfeiffer School of Mathematics, Statistics and Applied Mathematics NUI Galway September 21-22, 2015 Tutorials, Online Homework.
More informationPOLYNOMIAL FUNCTIONS
POLYNOMIAL FUNCTIONS Polynomial Division.. 314 The Rational Zero Test.....317 Descarte s Rule of Signs... 319 The Remainder Theorem.....31 Finding all Zeros of a Polynomial Function.......33 Writing a
More informationDeflections. Question: What are Structural Deflections?
Question: What are Structural Deflections? Answer: The deformations or movements of a structure and its components, such as beams and trusses, from their original positions. It is as important for the
More information1. Volatility Index. 2. India VIX* 3. India VIX :: computation methodology
1. Volatility Index Volatility Index is a measure of market s expectation of volatility over the near term. Usually, during periods of market volatility, market moves steeply up or down and the volatility
More information16 Circles and Cylinders
16 Circles and Cylinders 16.1 Introduction to Circles In this section we consider the circle, looking at drawing circles and at the lines that split circles into different parts. A chord joins any two
More informationSection 3-3 Approximating Real Zeros of Polynomials
- Approimating Real Zeros of Polynomials 9 Section - Approimating Real Zeros of Polynomials Locating Real Zeros The Bisection Method Approimating Multiple Zeros Application The methods for finding zeros
More informationA Geometric Characterization of Parametric Cubic Curves
A Geometric Characterization of Parametric Cubic Curves MAUREEN C. STONE Xerox PARC and TONY D. DEROSE University of Washington In this paper, we analyze planar parametric cubic curves to determine conditions
More informationCabri Geometry Application User Guide
Cabri Geometry Application User Guide Preview of Geometry... 2 Learning the Basics... 3 Managing File Operations... 12 Setting Application Preferences... 14 Selecting and Moving Objects... 17 Deleting
More informationNURBS Drawing Week 5, Lecture 10
CS 430/536 Computer Graphics I NURBS Drawing Week 5, Lecture 10 David Breen, William Regli and Maxim Peysakhov Geometric and Intelligent Computing Laboratory Department of Computer Science Drexel University
More informationCMSC 425: Lecture 13 Animation for Games: Basics Tuesday, Mar 26, 2013
CMSC 425: Lecture 13 Animation for Games: Basics Tuesday, Mar 26, 2013 Reading: Chapt 11 of Gregory, Game Engine Architecture. Game Animation: Most computer games revolve around characters that move around
More informationZeros of Polynomial Functions
Zeros of Polynomial Functions The Rational Zero Theorem If f (x) = a n x n + a n-1 x n-1 + + a 1 x + a 0 has integer coefficients and p/q (where p/q is reduced) is a rational zero, then p is a factor of
More informationOxford Cambridge and RSA Examinations
Oxford Cambridge and RSA Examinations OCR FREE STANDING MATHEMATICS QUALIFICATION (ADVANCED): ADDITIONAL MATHEMATICS 6993 Key Features replaces and (MEI); developed jointly by OCR and MEI; designed for
More informationMaking 3D Threads in Feature Based Solid Modelers
Making 3D Threads in Feature Based Solid Modelers THREAD BASICS Making true geometric threads in feature-based solid modelers is a fairly straightforward process and can be handled using several different
More informationMean value theorem, Taylors Theorem, Maxima and Minima.
MA 001 Preparatory Mathematics I. Complex numbers as ordered pairs. Argand s diagram. Triangle inequality. De Moivre s Theorem. Algebra: Quadratic equations and express-ions. Permutations and Combinations.
More information