Cubic Splines; Bézier Curves
|
|
- Nelson Foster
- 5 years ago
- Views:
Transcription
1 Cubic Splines; Bézier Curves 1 Cubic Splines piecewise approximation with cubic polynomials conditions on the coefficients of the splines 2 Bézier Curves computer-aided design and manufacturing MCS 471 Lecture 8(b) Numerical Analysis Jan Verschelde, 6 July 2018 Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
2 Cubic Splines; Bézier Curves 1 Cubic Splines piecewise approximation with cubic polynomials conditions on the coefficients of the splines 2 Bézier Curves computer-aided design and manufacturing Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
3 piecewise approximation with cubic polynomials f 1 f 0 f 2 f 3 f 5 f 4 x 0 x 1 x 2 x 3 x 4 x 5 Input: (x i, f i ), i = 0, 1,..., n, x 0 < x 1 < < x n. Interpolating splines S i through internal nodes x 1, x 2,..., x n 1 : S i 1 (x i 1 ) = S i (x i ) same value, S i 1 (x i 1) = S i (x i) same slope, S i 1 i 1) = S i (x i ) same concavity. Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
4 cubic splines Input: n + 1 data points (x 0, f 0 ), (x 1, f 1 ),..., (x n, f n ). Interpolating cubic splines: S i (x) = f i + b i (x x i ) + c i (x x i ) 2 + d i (x x i ) 3, on [x i, x i+1 ], i = 0, 1,..., n 1. We see S i (x i ) = f i. Additional conditions: S i (x i+1 ) = f i+1, i = 0, 1,..., n 1, S i 1 (x i) = S i (x i), i = 1, 2,..., n 1, S i 1 i) = S i (x i ), i = 1, 2,..., n 1. So we have n + (n 1) + (n 1) = 3n 2 conditions for 3n coefficients. Two degrees of freedom. For a natural spline, we require S 0 (x 0) = 0 and S n(x n ) = 0. Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
5 Cubic Splines; Bézier Curves 1 Cubic Splines piecewise approximation with cubic polynomials conditions on the coefficients of the splines 2 Bézier Curves computer-aided design and manufacturing Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
6 deriving conditions S i (x) = f i + b i (x x i ) + c i (x x i ) 2 + d i (x x i ) 3, S i (x) = b i + 2c i (x x i ) + 3d i (x x i ) 2, S i (x) = 2c i + 6d i (x x i ). Consider S i (x i ) = 2c i c i = S i (x i )/2, and then: S i (x i+1 ) = 2c i + 6d i (x i+1 x i ) S i (x i ) = 2c i S i (x i+1 ) S i (x i ) = 6d i (x i+1 x i ) d i = S i (x i+1 ) S i (x i ) 6(x i+1 x i ) Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
7 deriving conditions continued We have already derived the following: S i (x) = f i + b i (x x i ) + c i (x x i ) 2 + d i (x x i ) 3, c i = S i (x i )/2, d i = (S i (x i+1 ) S i (x i ))/(6(x i+1 x i )). Now we look for conditions on b i : S i (x i+1 ) = f i+1 = f i + b i (x i+1 x i ) + c i (x i+1 x i ) 2 + d i (x i+1 x i ) 3. f i+1 f i x i+1 x i = b i + c i (x i+1 x i ) + d i (x i+1 x i ) 2 = b i + S i (x i ) 2 = b i + S i (x i ) 2 (x i+1 x i ) + S i (x i+1 ) S 6(x i+1 x i ) (x i+1 x i ) + S i (x i+1 ) S 6(x i+1 x i ) i (x i ) (x i+1 x i ) 2 i (x i ) (x i+1 x i ) 2 Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
8 deriving conditions continued f i+1 f i = b i + S i (x i ) x i+1 x i 2 = b i + x i+1 x i 6 (x i+1 x i ) + S i (x i+1 ) S 6(x i+1 x i ) b i = f i+1 f i x i+1 x i x i+1 x i 6 ( 3S i (x i ) + S i (x i+1 ) S i (x i ) ) i (x i ) (x i+1 x i ) 2 (2S i (x i ) + S i (x i+1 )) Denote h i = x i+1 x i, T i = S i (x i ), T i+1 = S i (x i+1 ): b i = f i+1 f i h i h i 6 (2T i + T i+1 ), c i = T i 2, d i = T i+1 T i 6h i. Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
9 deriving conditions continued S i (x) = b i + 2c i (x x i ) + 3d i (x x i ) 2, S i (x i) = b i. Impose slope conditions S i 1 (x i) = S i (x i), h i = x i+1 x i. S i 1 (x i) = b i 1 + 2c i 1 (x i x i 1 ) + 3d i 1 (x i x i 1 ) 2 = f i f i 1 h i 1 h i 1 6 (2T i 1 + T i ) + 2 T i 1 2 h i T i T i 1 ( 3 = T i 6 h i 1 1 ) ( 6 h i 1 + T i h i 1 + h i 1 2 ) 6 h i 1 = 2 6 h i 1T i h i 1T i 1 + f i f i 1 h i 1 6h i 1 h 2 i 1 + f i f i 1 h i 1 Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
10 imposing slope conditions S i 1 (x i) = S i (x i) Recall: S i (x) = b i + 2c i (x x i ) + 3d i (x x i ) 2, S i (x i ) = b i = f i+1 f i h i h i 6 (2T i + T i+1 ). Thus we have: 2 6 h i 1T i h i 1T i 1 + f i f i 1 = f i+1 f i 2 h i 1 h i 6 h it i 1 6 h it i h it i (h i 1 + h i )T i h i 1T i 1 = f i+1 f i f i f i 1 h i h i 1 h i T i+1 + 2(h i 1 + h i )T i + h i 1 T i 1 = 6(f [x i, x i+1 ] f [x i 1, x i ]) for i = 1, 2,..., n, which gives n equations in n + 2 unknowns, with two additional conditions: T 0 = 0, T n+1 = 0. Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
11 an example, for n = 4 A = h 0 2(h 0 + h 1 ) h h 1 2(h 1 + h 2 ) h h 2 2(h 2 + h 3 ) h 3 A T 0 T 1 T 2 T 3 T 4 = 6(f [x 1, x 2 ] f [x 0, x 1 ]) 6(f [x 2, x 3 ] f [x 1, x 2 ]) 6(f [x 3, x 4 ] f [x 2, x 3 ]) With T 0 = 0 and T 4 = 0: a 3-by-3 linear system. b i = f i+1 f i h i h i 6 (2T i + T i+1 ), c i = T i 2, d i = T i+1 T i 6h i. S i (x) = f i + b i (x x i ) + c i (x x i ) 2 + d i (x x i ) 3. Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
12 compute a numerical example Exercise 1: Compute the natural cubic spline through the points (1, 1), (2, 5), (3, 6), and (4, 0). Verify that your solution satisfies all conditions, as listed on slide #4. Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
13 uniqueness of the cubic spline Observe that the system in the T i s is diagonally dominant. This implies that the linear system has a unique solution. Theorem For inputs (x i, f i ), i = 0, 1,..., n, x 0 < x 1 < < x n, there is a unique piecewise approximation with cubic splines S i : interpolating: S i (x i ) = f i, i = 0, 1,..., n 1, S n 1 (x n ) = f n, at all internal nodes, for i = 1, 2,..., n 1: S i 1 (x i 1 ) = S i (x i ), S i 1 (x i 1) = S i (x i), S i 1 (x i 1) = S i (x i ), natural: S 0 (x 0) = 0, S n 1 (x n) = 0. Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
14 numerical conditioning Exercise 2: Consider the matrix for n = 6: 2(h 0 + h 1 ) h h 1 2(h 1 + h 2 ) h A = 0 h 2 2(h 2 + h 3 ) h h 3 2(h 3 + h 4 ) h 4, h 4 2(h 4 + h 5 ) where h i is the distance between x i and x i+1, for i = 0, 1,..., 5. 1 Generate random values for all h i s and compute the condition number of A. Is this problem well conditioned? Justify. 2 For which values of h i is the matrix A poorly conditioned? Generate an example and justify your choice for the distances. Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
15 Cubic Splines; Bézier Curves 1 Cubic Splines piecewise approximation with cubic polynomials conditions on the coefficients of the splines 2 Bézier Curves computer-aided design and manufacturing Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
16 Bézier Curves Bézier curves are splines that allow to control the slopes at the knots. y x Input: knot (1, 1) with control (1, 3), knot (2, 2) with control (3, 3). Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
17 a Bézier curve Input: end points (x 1, y 1 ), (x 4, y 4 ); and control points (x 2, y 2 ), (x 3, y 3 ). Set b x = 3(x 2 x 1 ), c x = 3(x 3 x 2 ) b x, d x = x 4 x 1 b x c x, b y = 3(y 2 y 1 ), c y = 3(y 3 y 2 ) b y, d y = y 4 y 1 b y c y, then the Bézier curve (x(t), y(t)), for t [0, 1], is x(t) = x 1 + b x t + c x t 2 + d x t 3 y(t) = y 1 + b y t + c y t 2 + d y t 3. We see that x(0) = x 1 and y(0) = y 1, x (0) = b x and y (0) = b y. x(1) = x 1 + b x + c x + x 4 x 1 b x c x = x 4 x (1) = b x + 2c x + 3(x 4 x 1 b x c x ) = 3(x 4 x 1 ) 2b x c x = 3(x 4 x 1 ) 2b x (3(x 3 x 2 ) b x ) = 3(x 4 x 1 ) 3(x 2 x 1 ) 3(x 3 x 2 ) = 3(x 4 x 3 ). Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
18 an example Input: knot (1, 1) with control (1, 3), knot (2, 2) with control (3, 3). y x Output: x(t) = 1 + 6t 2 5t 3, y(t) = 1 + 6t 6t 2 + t 3. Numerical Analysis (MCS 471) Cubic Splines; Bézier Curves L-8(b) 6 July / 18
Global polynomial interpolants suffer from the Runge Phenomenon if the data sites (nodes) are not chosen correctly.
Piecewise polynomial interpolation Global polynomial interpolants suffer from the Runge Phenomenon if the data sites (nodes) are not chosen correctly. In many applications, one does not have the freedom
More informationCubic Splines MATH 375. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Cubic Splines
Cubic Splines MATH 375 J. Robert Buchanan Department of Mathematics Fall 2006 Introduction Given data {(x 0, f(x 0 )), (x 1, f(x 1 )),...,(x n, f(x n ))} which we wish to interpolate using a polynomial...
More information1 Piecewise Cubic Interpolation
Piecewise Cubic Interpolation Typically the problem with piecewise linear interpolation is the interpolant is not differentiable as the interpolation points (it has a kinks at every interpolation point)
More informationSample Exam 1 KEY NAME: 1. CS 557 Sample Exam 1 KEY. These are some sample problems taken from exams in previous years. roughly ten questions.
Sample Exam 1 KEY NAME: 1 CS 557 Sample Exam 1 KEY These are some sample problems taken from exams in previous years. roughly ten questions. Your exam will have 1. (0 points) Circle T or T T Any curve
More informationQ 0 x if x 0 x x 1. S 1 x if x 1 x x 2. i 0,1,...,n 1, and L x L n 1 x if x n 1 x x n
. - Piecewise Linear-Quadratic Interpolation Piecewise-polynomial Approximation: Problem: Givenn pairs of data points x i, y i, i,,...,n, find a piecewise-polynomial Sx S x if x x x Sx S x if x x x 2 :
More information3.1 Interpolation and the Lagrange Polynomial
MATH 4073 Chapter 3 Interpolation and Polynomial Approximation Fall 2003 1 Consider a sample x x 0 x 1 x n y y 0 y 1 y n. Can we get a function out of discrete data above that gives a reasonable estimate
More informationSPLINE INTERPOLATION
Spline Background SPLINE INTERPOLATION Problem: high degree interpolating polynomials often have extra oscillations. Example: Runge function f(x = 1 1+4x 2, x [ 1, 1]. 1 1/(1+4x 2 and P 8 (x and P 16 (x
More informationLecture 10 Polynomial interpolation
Lecture 10 Polynomial interpolation Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn
More informationFitting a Natural Spline to Samples of the Form (t, f(t))
Fitting a Natural Spline to Samples of the Form (t, f(t)) David Eberly, Geometric Tools, Redmond WA 9852 https://wwwgeometrictoolscom/ This work is licensed under the Creative Commons Attribution 4 International
More informationLectures 9-10: Polynomial and piecewise polynomial interpolation
Lectures 9-1: Polynomial and piecewise polynomial interpolation Let f be a function, which is only known at the nodes x 1, x,, x n, ie, all we know about the function f are its values y j = f(x j ), j
More informationMA 323 Geometric Modelling Course Notes: Day 20 Curvature and G 2 Bezier splines
MA 323 Geometric Modelling Course Notes: Day 20 Curvature and G 2 Bezier splines David L. Finn Yesterday, we introduced the notion of curvature and how it plays a role formally in the description of curves,
More informationEmpirical Models Interpolation Polynomial Models
Mathematical Modeling Lia Vas Empirical Models Interpolation Polynomial Models Lagrange Polynomial. Recall that two points (x 1, y 1 ) and (x 2, y 2 ) determine a unique line y = ax + b passing them (obtained
More informationLagrange Interpolation and Neville s Algorithm. Ron Goldman Department of Computer Science Rice University
Lagrange Interpolation and Neville s Algorithm Ron Goldman Department of Computer Science Rice University Tension between Mathematics and Engineering 1. How do Mathematicians actually represent curves
More informationNumerical Methods I: Interpolation (cont ed)
1/20 Numerical Methods I: Interpolation (cont ed) Georg Stadler Courant Institute, NYU stadler@cims.nyu.edu November 30, 2017 Interpolation Things you should know 2/20 I Lagrange vs. Hermite interpolation
More informationApplied Math 205. Full office hour schedule:
Applied Math 205 Full office hour schedule: Rui: Monday 3pm 4:30pm in the IACS lounge Martin: Monday 4:30pm 6pm in the IACS lounge Chris: Tuesday 1pm 3pm in Pierce Hall, Room 305 Nao: Tuesday 3pm 4:30pm
More informationKeyframing. CS 448D: Character Animation Prof. Vladlen Koltun Stanford University
Keyframing CS 448D: Character Animation Prof. Vladlen Koltun Stanford University Keyframing in traditional animation Master animator draws key frames Apprentice fills in the in-between frames Keyframing
More informationInterpolation and extrapolation
Interpolation and extrapolation Alexander Khanov PHYS6260: Experimental Methods is HEP Oklahoma State University October 30, 207 Interpolation/extrapolation vs fitting Formulation of the problem: there
More informationModule - 02 Lecture 11
Manufacturing Systems Technology Prof. Shantanu Bhattacharya Department of Mechanical Engineering and Design Programme Indian Institute of Technology, Kanpur Module - 0 Lecture 11 (Refer Slide Time: 00:17)
More informationEngineering 7: Introduction to computer programming for scientists and engineers
Engineering 7: Introduction to computer programming for scientists and engineers Interpolation Recap Polynomial interpolation Spline interpolation Regression and Interpolation: learning functions from
More informationComputational Physics
Interpolation, Extrapolation & Polynomial Approximation Lectures based on course notes by Pablo Laguna and Kostas Kokkotas revamped by Deirdre Shoemaker Spring 2014 Introduction In many cases, a function
More informationCONTROL POLYGONS FOR CUBIC CURVES
On-Line Geometric Modeling Notes CONTROL POLYGONS FOR CUBIC CURVES Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis Overview B-Spline
More informationIntroduction to Computer Graphics. Modeling (1) April 13, 2017 Kenshi Takayama
Introduction to Computer Graphics Modeling (1) April 13, 2017 Kenshi Takayama Parametric curves X & Y coordinates defined by parameter t ( time) Example: Cycloid x t = t sin t y t = 1 cos t Tangent (aka.
More information1 Review of Interpolation using Cubic Splines
cs412: introduction to numerical analysis 10/10/06 Lecture 12: Instructor: Professor Amos Ron Cubic Hermite Spline Interpolation Scribes: Yunpeng Li, Mark Cowlishaw 1 Review of Interpolation using Cubic
More informationChapter 4: Interpolation and Approximation. October 28, 2005
Chapter 4: Interpolation and Approximation October 28, 2005 Outline 1 2.4 Linear Interpolation 2 4.1 Lagrange Interpolation 3 4.2 Newton Interpolation and Divided Differences 4 4.3 Interpolation Error
More informationINTERPOLATION. and y i = cos x i, i = 0, 1, 2 This gives us the three points. Now find a quadratic polynomial. p(x) = a 0 + a 1 x + a 2 x 2.
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 informationWe consider the problem of finding a polynomial that interpolates a given set of values:
Chapter 5 Interpolation 5. Polynomial Interpolation We consider the problem of finding a polynomial that interpolates a given set of values: x x 0 x... x n y y 0 y... y n where the x i are all distinct.
More informationCurves. Hakan Bilen University of Edinburgh. Computer Graphics Fall Some slides are courtesy of Steve Marschner and Taku Komura
Curves Hakan Bilen University of Edinburgh Computer Graphics Fall 2017 Some slides are courtesy of Steve Marschner and Taku Komura How to create a virtual world? To compose scenes We need to define objects
More informationFast Convolution; Strassen s Method
Fast Convolution; Strassen s Method 1 Fast Convolution reduction to subquadratic time polynomial evaluation at complex roots of unity interpolation via evaluation at complex roots of unity 2 The Master
More informationComputergrafik. Matthias Zwicker Universität Bern Herbst 2016
Computergrafik Matthias Zwicker Universität Bern Herbst 2016 2 Today Curves Introduction Polynomial curves Bézier curves Drawing Bézier curves Piecewise curves Modeling Creating 3D objects How to construct
More informationCubic Splines. Antony Jameson. Department of Aeronautics and Astronautics, Stanford University, Stanford, California, 94305
Cubic Splines Antony Jameson Department of Aeronautics and Astronautics, Stanford University, Stanford, California, 94305 1 References on splines 1. J. H. Ahlberg, E. N. Nilson, J. H. Walsh. Theory of
More informationMTH5112 Linear Algebra I MTH5212 Applied Linear Algebra (2017/2018)
MTH5112 Linear Algebra I MTH5212 Applied Linear Algebra (2017/2018) COURSEWORK 3 SOLUTIONS Exercise ( ) 1. (a) Write A = (a ij ) n n and B = (b ij ) n n. Since A and B are diagonal, we have a ij = 0 and
More informationPiecewise Polynomial Interpolation
Piecewise Polynomial Interpolation 1 Piecewise linear interpolation Suppose we have data point (x k,y k ), k =0, 1,...N. A piecewise linear polynomial that interpolates these points is given by p(x) =p
More informationLecture 20: Bezier Curves & Splines
Lecture 20: Bezier Curves & Splines December 6, 2016 12/6/16 CSU CS410 Bruce Draper & J. Ross Beveridge 1 Review: The Pen Metaphore Think of putting a pen to paper Pen position described by time t Seeing
More informationM2R IVR, October 12th Mathematical tools 1 - Session 2
Mathematical tools 1 Session 2 Franck HÉTROY M2R IVR, October 12th 2006 First session reminder Basic definitions Motivation: interpolate or approximate an ordered list of 2D points P i n Definition: spline
More informationChapter 1 Numerical approximation of data : interpolation, least squares method
Chapter 1 Numerical approximation of data : interpolation, least squares method I. Motivation 1 Approximation of functions Evaluation of a function Which functions (f : R R) can be effectively evaluated
More informationdirected weighted graphs as flow networks the Ford-Fulkerson algorithm termination and running time
Network Flow 1 The Maximum-Flow Problem directed weighted graphs as flow networks the Ford-Fulkerson algorithm termination and running time 2 Maximum Flows and Minimum Cuts flows and cuts max flow equals
More informationComputing the Hausdorff Distance between Two B-Spline Curves. Zachi Shtain
Computing the Hausdorff Distance between Two B-Spline Curves Zachi Shtain Based on the work of: Chen et al. 2010 Definition Given two curves C 1, C 2, their Hausdorff distance is defined as: H Where:,
More informationAlternatives. The D Operator
Using Smoothness Alternatives Text: Chapter 5 Some disadvantages of basis expansions Discrete choice of number of basis functions additional variability. Non-hierarchical bases (eg B-splines) make life
More informationAP Calculus BC. Free-Response Questions
2018 AP Calculus BC Free-Response Questions College Board, Advanced Placement Program, AP, AP Central, and the acorn logo are registered trademarks of the College Board. AP Central is the official online
More informationNumerical Methods I: Polynomial Interpolation
1/31 Numerical Methods I: Polynomial Interpolation Georg Stadler Courant Institute, NYU stadler@cims.nyu.edu November 16, 2017 lassical polynomial interpolation Given f i := f(t i ), i =0,...,n, we would
More informationCurve Fitting and Interpolation
Chapter 5 Curve Fitting and Interpolation 5.1 Basic Concepts Consider a set of (x, y) data pairs (points) collected during an experiment, Curve fitting: is a procedure to develop or evaluate mathematical
More informationCMSC427 Parametric curves: Hermite, Catmull-Rom, Bezier
CMSC427 Parametric curves: Hermite, Catmull-Rom, Bezier Modeling Creating 3D objects How to construct complicated surfaces? Goal Specify objects with few control points Resulting object should be visually
More informationPolynomial Interpolation Part II
Polynomial Interpolation Part II Prof. Dr. Florian Rupp German University of Technology in Oman (GUtech) Introduction to Numerical Methods for ENG & CS (Mathematics IV) Spring Term 2016 Exercise Session
More informationName: Date: Block: Quarter 2 Summative Assessment Revision #1
Name: Date: Block: Multiple Choice Non-Calculator Quarter Summative Assessment Revision #1 1. The graph of y = x x has a relative maximum at (a) (0,0) only (b) (1,) only (c) (,4) only (d) (4, 16) only
More informationUp/down-sampling & interpolation Centre for Doctoral Training in Healthcare Innovation
Up/down-sampling & interpolation Centre for Doctoral Training in Healthcare Innovation Dr. Gari D. Clifford, University Lecturer & Director, Centre for Doctoral Training in Healthcare Innovation, Institute
More informationCubic Spline. s(x) = s j (x) = a j + b j (x x j ) + c j (x x j ) 2 + d j (x x j ) 3, j = 0,... n 1 (1)
Cubic Spline Suppose we are given a set of interpolating points (x i, y i ) for i = 0, 1, 2, n We seek to construct a piecewise cubic function s(x) that has the for x [[x j, x j+1 ] we have: s(x) = s j
More informationSome notes on Chapter 8: Polynomial and Piecewise-polynomial Interpolation
Some notes on Chapter 8: Polynomial and Piecewise-polynomial Interpolation See your notes. 1. Lagrange Interpolation (8.2) 1 2. Newton Interpolation (8.3) different form of the same polynomial as Lagrange
More informationThe Essentials of CAGD
The Essentials of CAGD Chapter 4: Bézier Curves: Cubic and Beyond Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/essentials-cagd c 2000
More informationA first order divided difference
A first order divided difference For a given function f (x) and two distinct points x 0 and x 1, define f [x 0, x 1 ] = f (x 1) f (x 0 ) x 1 x 0 This is called the first order divided difference of f (x).
More informationCSE 167: Lecture 11: Bézier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2012
CSE 167: Introduction to Computer Graphics Lecture 11: Bézier Curves Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2012 Announcements Homework project #5 due Nov. 9 th at 1:30pm
More informationCalculus and Parametric Equations
Calculus and Parametric Equations MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction Given a pair a parametric equations x = f (t) y = g(t) for a t b we know how
More informationApproximation of Circular Arcs by Parametric Polynomials
Approximation of Circular Arcs by Parametric Polynomials Emil Žagar Lecture on Geometric Modelling at Charles University in Prague December 6th 2017 1 / 44 Outline Introduction Standard Reprezentations
More informationMA 323 Geometric Modelling Course Notes: Day 07 Parabolic Arcs
MA 323 Geometric Modelling Course Notes: Day 07 Parabolic Arcs David L. Finn December 9th, 2004 We now start considering the basic curve elements to be used throughout this course; polynomial curves and
More informationLösning: Tenta Numerical Analysis för D, L. FMN011,
Lösning: Tenta Numerical Analysis för D, L. FMN011, 090527 This exam starts at 8:00 and ends at 12:00. To get a passing grade for the course you need 35 points in this exam and an accumulated total (this
More informationIntroduction to Curves. Modelling. 3D Models. Points. Lines. Polygons Defined by a sequence of lines Defined by a list of ordered points
Introduction to Curves Modelling Points Defined by 2D or 3D coordinates Lines Defined by a set of 2 points Polygons Defined by a sequence of lines Defined by a list of ordered points 3D Models Triangular
More informationArsène Pérard-Gayot (Slides by Piotr Danilewski)
Computer Graphics - Splines - Arsène Pérard-Gayot (Slides by Piotr Danilewski) CURVES Curves Explicit y = f x f: R R γ = x, f x y = 1 x 2 Implicit F x, y = 0 F: R 2 R γ = x, y : F x, y = 0 x 2 + y 2 =
More informationPiecewise Polynomial Interpolation
Piecewise Polynomial Interpolation 1 Piecewise linear interpolation Suppose we have data point (x k,y k ), k =0, 1,...N. A piecewise linear polynomial that interpolates these points is given by p(x) =p
More informationInput: A set (x i -yy i ) data. Output: Function value at arbitrary point x. What for x = 1.2?
Applied Numerical Analysis Interpolation Lecturer: Emad Fatemizadeh Interpolation Input: A set (x i -yy i ) data. Output: Function value at arbitrary point x. 0 1 4 1-3 3 9 What for x = 1.? Interpolation
More informationFixed point iteration and root finding
Fixed point iteration and root finding The sign function is defined as x > 0 sign(x) = 0 x = 0 x < 0. It can be evaluated via an iteration which is useful for some problems. One such iteration is given
More informationInterpolation and Deformations A short cookbook
Interpolation and Deformations A short cookbook 600.445 Fall 2000; Updated: 0 October 2002 Linear Interpolation p ρ 2 2 = [ 40 30 20] = 20 T p ρ = [ 0 5 20] = 5 p 3 = ρ3 =? 0?? T [ 20 20 20] T 2 600.445
More informationHermite Interpolation with Euclidean Pythagorean Hodograph Curves
Hermite Interpolation with Euclidean Pythagorean Hodograph Curves Zbyněk Šír Faculty of Mathematics and Physics, Charles University in Prague Sokolovská 83, 86 75 Praha 8 zbynek.sir@mff.cuni.cz Abstract.
More informationn 1 f n 1 c 1 n+1 = c 1 n $ c 1 n 1. After taking logs, this becomes
Root finding: 1 a The points {x n+1, }, {x n, f n }, {x n 1, f n 1 } should be co-linear Say they lie on the line x + y = This gives the relations x n+1 + = x n +f n = x n 1 +f n 1 = Eliminating α and
More informationUniversity of British Columbia Math 307, Final
1 University of British Columbia Math 307, Final April 23, 2012 3.30-6.00pm Name: Student Number: Signature: Instructor: Instructions: 1. No notes, books or calculators are allowed. A MATLAB/Octave formula
More informationInterpolation. 1. Judd, K. Numerical Methods in Economics, Cambridge: MIT Press. Chapter
Key References: Interpolation 1. Judd, K. Numerical Methods in Economics, Cambridge: MIT Press. Chapter 6. 2. Press, W. et. al. Numerical Recipes in C, Cambridge: Cambridge University Press. Chapter 3
More informationMath Numerical Analysis Mid-Term Test Solutions
Math 400 - Numerical Analysis Mid-Term Test Solutions. Short Answers (a) A sufficient and necessary condition for the bisection method to find a root of f(x) on the interval [a,b] is f(a)f(b) < 0 or f(a)
More informationTwo Applications of Maximum Flow
Two Applications of Maximum Flow The Bipartite Matching Problem a bipartite graph as a flow network maximum flow and maximum matching alternating paths perfect matchings 2 Circulation with Demands flows
More informationLecture 1 INF-MAT : Chapter 2. Examples of Linear Systems
Lecture 1 INF-MAT 4350 2010: Chapter 2. Examples of Linear Systems Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo August 26, 2010 Notation The set of natural
More informationPreliminary Examination in Numerical Analysis
Department of Applied Mathematics Preliminary Examination in Numerical Analysis August 7, 06, 0 am pm. Submit solutions to four (and no more) of the following six problems. Show all your work, and justify
More informationMath 578: Assignment 2
Math 578: Assignment 2 13. Determine whether the natural cubic spline that interpolates the table is or is not the x 0 1 2 3 y 1 1 0 10 function 1 + x x 3 x [0, 1] f(x) = 1 2(x 1) 3(x 1) 2 + 4(x 1) 3 x
More informationMAT300/500 Programming Project Spring 2019
MAT300/500 Programming Project Spring 2019 Please submit all project parts on the Moodle page for MAT300 or MAT500. Due dates are listed on the syllabus and the Moodle site. You should include all neccessary
More informationReverse engineering using computational algebra
Reverse engineering using computational algebra Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4500, Spring 2015 M. Macauley (Clemson)
More informationLecture Note 3: Interpolation and Polynomial Approximation. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 3: Interpolation and Polynomial Approximation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 10, 2015 2 Contents 1.1 Introduction................................ 3 1.1.1
More informationOutline. 1 Interpolation. 2 Polynomial Interpolation. 3 Piecewise Polynomial Interpolation
Outline Interpolation 1 Interpolation 2 3 Michael T. Heath Scientific Computing 2 / 56 Interpolation Motivation Choosing Interpolant Existence and Uniqueness Basic interpolation problem: for given data
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 7 Interpolation Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted
More informationMath 660-Lecture 15: Finite element spaces (I)
Math 660-Lecture 15: Finite element spaces (I) (Chapter 3, 4.2, 4.3) Before we introduce the concrete spaces, let s first of all introduce the following important lemma. Theorem 1. Let V h consists of
More informationInterpolation. Escuela de Ingeniería Informática de Oviedo. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 1 / 34
Interpolation Escuela de Ingeniería Informática de Oviedo (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 1 / 34 Outline 1 Introduction 2 Lagrange interpolation 3 Piecewise polynomial
More informationCHAPTER 3 Further properties of splines and B-splines
CHAPTER 3 Further properties of splines and B-splines In Chapter 2 we established some of the most elementary properties of B-splines. In this chapter our focus is on the question What kind of functions
More informationRobotics I. June 6, 2017
Robotics I June 6, 217 Exercise 1 Consider the planar PRPR manipulator in Fig. 1. The joint variables defined therein are those used by the manufacturer and do not correspond necessarily to a Denavit-Hartenberg
More informationLecture 23: Hermite and Bezier Curves
Lecture 23: Hermite and Bezier Curves November 16, 2017 11/16/17 CSU CS410 Fall 2017, Ross Beveridge & Bruce Draper 1 Representing Curved Objects So far we ve seen Polygonal objects (triangles) and Spheres
More informationInterpolation Theory
Numerical Analysis Massoud Malek Interpolation Theory The concept of interpolation is to select a function P (x) from a given class of functions in such a way that the graph of y P (x) passes through the
More informationLecture 38 Insulated Boundary Conditions
Lecture 38 Insulated Boundary Conditions Insulation In many of the previous sections we have considered fixed boundary conditions, i.e. u(0) = a, u(l) = b. We implemented these simply by assigning u j
More informationLinear Regression Model. Badr Missaoui
Linear Regression Model Badr Missaoui Introduction What is this course about? It is a course on applied statistics. It comprises 2 hours lectures each week and 1 hour lab sessions/tutorials. We will focus
More informationInterpolation and polynomial approximation Interpolation
Outline Interpolation and polynomial approximation Interpolation Lagrange Cubic Splines Approximation B-Splines 1 Outline Approximation B-Splines We still focus on curves for the moment. 2 3 Pierre Bézier
More informationMA2501 Numerical Methods Spring 2015
Norwegian University of Science and Technology Department of Mathematics MA5 Numerical Methods Spring 5 Solutions to exercise set 9 Find approximate values of the following integrals using the adaptive
More informationThere is a unique function s(x) that has the required properties. It turns out to also satisfy
Numerical Analysis Grinshpan Natural Cubic Spline Let,, n be given nodes (strictly increasing) and let y,, y n be given values (arbitrary) Our goal is to produce a function s() with the following properties:
More informationFinite element function approximation
THE UNIVERSITY OF WESTERN ONTARIO LONDON ONTARIO Paul Klein Office: SSC 4028 Phone: 661-2111 ext. 85227 Email: paul.klein@uwo.ca URL: www.ssc.uwo.ca/economics/faculty/klein/ Economics 613/614 Advanced
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J Olver 3 Approximation and Interpolation We will now apply our minimization results to the interpolation and least squares fitting of data and functions 3 Least
More informationHome Page. Title Page. Contents. Bezier Curves. Milind Sohoni sohoni. Page 1 of 27. Go Back. Full Screen. Close.
Bezier Curves Page 1 of 27 Milind Sohoni http://www.cse.iitb.ac.in/ sohoni Recall Lets recall a few things: 1. f : [0, 1] R is a function. 2. f 0,..., f i,..., f n are observations of f with f i = f( i
More informationReview for the Midterm Exam
Review for the Midterm Exam 1 Three Questions of the Computational Science Prelim scaled speedup network topologies work stealing 2 The in-class Spring 2012 Midterm Exam pleasingly parallel computations
More informationTutorial for the supercritical pressure pipe with STAR-CCM+
Tutorial for the supercritical pressure pipe with STAR-CCM+ For performing this tutorial, it is necessary to have already studied the tutorial on the upward bend. In fact, after getting abilities with
More informationG-code and PH curves in CNC Manufacturing
G-code and PH curves in CNC Manufacturing Zbyněk Šír Institute of Applied Geometry, JKU Linz The research was supported through grant P17387-N12 of the Austrian Science Fund (FWF). Talk overview Motivation
More informationRegression: Lecture 2
Regression: Lecture 2 Niels Richard Hansen April 26, 2012 Contents 1 Linear regression and least squares estimation 1 1.1 Distributional results................................ 3 2 Non-linear effects and
More informationLecture 7: Interpolation
Lecture 7: Interpolation ECE 401: Signal and Image Analysis University of Illinois 2/9/2017 1 Sampling Review 2 Interpolation and Upsampling 3 Spectrum of Interpolated Signals Outline 1 Sampling Review
More informationInterpolation and Deformations A short cookbook
Interpolation and Deformations A short cookbook 600.445 Fall 2000; Updated: 29 September 205 Linear Interpolation p ρ 2 2 = [ 40 30 20] = 20 T p ρ = [ 0 5 20] = 5 p 3 = ρ3 =? 0?? T [ 20 20 20] T 2 600.445
More informationExam 2. Average: 85.6 Median: 87.0 Maximum: Minimum: 55.0 Standard Deviation: Numerical Methods Fall 2011 Lecture 20
Exam 2 Average: 85.6 Median: 87.0 Maximum: 100.0 Minimum: 55.0 Standard Deviation: 10.42 Fall 2011 1 Today s class Multiple Variable Linear Regression Polynomial Interpolation Lagrange Interpolation Newton
More informationLecture 04: Secret Sharing Schemes (2) Secret Sharing
Lecture 04: Schemes (2) Recall: Goal We want to Share a secret s Z p to n parties, such that {1,..., n} Z p, Any two parties can reconstruct the secret s, and No party alone can predict the secret s Recall:
More informationCurves, Surfaces and Segments, Patches
Curves, Surfaces and Segments, atches The University of Texas at Austin Conics: Curves and Quadrics: Surfaces Implicit form arametric form Rational Bézier Forms and Join Continuity Recursive Subdivision
More informationReading. w Foley, Section 11.2 Optional
Parametric Curves w Foley, Section.2 Optional Reading w Bartels, Beatty, and Barsky. An Introduction to Splines for use in Computer Graphics and Geometric Modeling, 987. w Farin. Curves and Surfaces for
More informationCGT 511. Curves. Curves. Curves. What is a curve? 2) A continuous map of a 1D space to an nd space
Curves CGT 511 Curves Bedřich Beneš, Ph.D. Purdue University Department of Computer Graphics Technology What is a curve? Mathematical ldefinition i i is a bit complex 1) The continuous o image of an interval
More informationBernstein polynomials of degree N are defined by
SEC. 5.5 BÉZIER CURVES 309 5.5 Bézier Curves Pierre Bézier at Renault and Paul de Casteljau at Citroën independently developed the Bézier curve for CAD/CAM operations, in the 1970s. These parametrically
More information