lecture 10: B-Splines
|
|
- Vivian Lloyd
- 6 years ago
- Views:
Transcription
1 9 lecture : -Splines -Splines: a basis for splines Throughout our discussion of standard polynomial interpolation, we viewed P n as a linear space of dimension n +, and then expressed the unique interpolating polynomial in several different bases (monomial, Newton, Lagrange) The most elegant way to develop spline functions uses the same approach A set of basis splines, depending only on the location of the knots and the degree of the approximating piecewise polynomials can be developed in a convenient, numerically stable manner (Cubic splines are the most prominent special case) For example, each cubic basis spline, or -spline, is a continuous piecewise-cubic function with continuous first and second derivatives Thus any linear combination of such -splines will inherit the same continuity properties The coefficients in the linear combination are chosen to obey the specified interpolation conditions -splines are built up recursively from constant -splines Though we are interpolating data at n + knots x,,x n, to derive -splines we need extra nodes outside [x, x n ] as scaffolding upon which to construct the basis Thus, add knots on either end of x and x n : < x < x < x < x < < x n < x n+ < Given these knots, define the constant (zeroth-degree) -splines: ( x [x j, (x) j, x j+ ); otherwise The following plot shows the basis function, for the knots x j j Note, in particular, that j, (x j+ ) The line drawn beneath the spline marks the support of the spline, that is, the values of x for which, (x), (x) x From these degree- -splines, manufacture -splines of higher degree via the recurrence!! x x j x j+k+ x () j,k (x) x j,k (x)+ j x j+k+ x j+,k (x) j+ x j+k
2 While not immediately obvious from the formula, this construction ensures that j,k has one more continuous derivative than does j,k Thus, while j, is discontinuous (see previous plot), j, is continuous, j, C (IR), and j, C (IR) One can see this in the three plots below, where again x j j As the degree increases, the -spline j,k becomes increasingly smooth Smooth is good, but it has a consequence: the support of j,k gets larger as we increase k This, as we will see, has implications on the number of nonzero entries in the linear system we must ultimately solve to find the expansion of the desired spline in the -spline basis, (x) x, (x) x, (x) From these plots and the recurrence defining j,k, one can deduce several important properties: x j,k C k (IR) (continuity); j,k (x) if x (x j, x j+k+ ) (compact support); j,k (x) > for x (x j, x j+k+ ) (positivity) Finally, we are prepared to write down a formula for the spline that interpolates {(x j, f j )} n j as a linear combination of the basis splines we have just constructed Let S k (x) denote the spline consisting of piecewise polynomials in P k In particular, S k must obey the following properties:
3 S k (x j ) f j for j,, n; S k C k [x, x n ] for k The beauty of -splines is that the second of these properties is automatically inherited from the -splines themselves (Any linear combination of C k (IR) functions must itself be a C k (IR) function) The interpolation conditions give n + equations that constrain the unknown coefficients c j,k in the expansion of S k : () S k (x)  c j,k j,k (x) j What limits should j have in this sum? For the greatest flexibility, let j range over all values for which j,k (x) for some x [x, x n ] Figure shows the -splines of degree k,, that overlap the interval [x, x ] for x j j For k, j,k (x) is supported on (x j, x j+k+ ), and hence the limits on the sum in () take the form If j,k (x) for all x [x, x n ], it cannot contribute to the interpolation requirement S k (x j ) f j, j,, n () S k (x) n  c j,k j,k (x), k j k The sum involves n + k coefficients c j,k, which must be determined to,,,,, Figure : -splines of degree k (top), k (middle), and k (bottom) that are supported on the interval [x, x n ] for x j j with n Note that n + k -splines are supported on [x, x n ] - - -,,,,,, - - -,,,,,,, - - -
4 satisfy the n + interpolation conditions f` S k (x`) n  c j,k j,k (x`), `,, n j k efore addressing general k of k, ie, constant splines, we pause to handle the special case Constant splines, k The constant -splines give n, (x n )and so, unlike the general k case, the j n -spline must be included in the spline sum: S (x) n  c j, j, (x) j The interpolation conditions give, for `,, n, f` S (x`) n  c j, j, (x`) j c`, `, (x`) c`,, since j, (x`) if j `, and `, (x`) (recall the plot of, (x) shown earlier) Thus c`, f`, and the degree k spline interpolant is simply S (x) n  f j j, (x) j
5 lecture : Matrix Determination of Splines; Energy Minimization General case, k Now consider the general spline interpolant of degree k, S k (x) n  c j,k j,k (x), j k with constants c k,k,,c n conditions S k (`) f`, ie,,k determined to satisfy the interpolation n  c j,k j,k (x`) f`, `,, n j k y now we are accustomed to transforming constraints like this into matrix equations Each value `,, n gives a row of the equation () k,k (x ) k+,k (x ) n,k (x ) k,k (x ) k+,k (x ) n,k (x ) k,k (x n ) k+,k (x n ) n,k (x n ) c k,k c k+,k c n,k f f f n Let us consider the matrix in this equation The matrix will have n + rows and n + k columns, so when k > the system of equations will be underdetermined Since -splines have small support (ie, One could obtain an (n + ) (n + ) j,k (x) for most x [x, x n ]), this matrix will be sparse: most entries will be zero The following subsections will describe the particular form the system () takes for k,, In each case we will illustrate the resulting spline interpolant through the following data set matrix by arbitrarily setting k certain values of c j,k to zero, but this would miss a great opportunity: we can constructively include all n + k -splines and impose k extra properties on S k to pick out a unique spline interpolant from the infinitely many options that satisfy the interpolation conditions () j x j f j Linear splines, k Linear splines are simple to construct: in this case n + k n +, so the matrix in () is square Let us evaluate it: since j, (x`) (, j `;, j `,
6 Figure : Linear spline S interpolating data points {(x j, f j )} j S (x) the matrix is simply, (x ), (x ) n, (x ), (x ), (x ) n, (x ), (x n ), (x n ) n, (x n ) I The system () is thus trivial to solve, reducing to c, c,k f f c n,k f n which gives the unique linear spline, S (x) n  f j+ j, (x) j Figure shows the unique piecewise linear spline interpolant to the data in (), which is a linear combination of the five linear splines shown in Figure Explicitly, This above discussion is a pedantic way to arrive at an obvious solution: Since the jth hat function -spline equals one at x j+ and zero at all other knots, just write the unique formula for the interpolant immediately S (x) f, (x)+ f, (x)+ f, (x)+ f, (x)+ f, (x), (x)+, (x)+, (x), (x)+, (x)
7 Note that linear splines are simply C functions that interpolate a given data set between the knots, they are identical to the piecewise linear functions constructed in Section Note that S (x) is supported on (x, x n+ ) with S (x) for all x (x, x n+ ) This is a general feature of splines: Outside the range of interpolation, S k (x) goes to zero as quickly as possible for a given set of knots while still maintaining the specified continuity Quadratic splines, k The construction of quadratic -splines from the linear splines via the recurrence () forces the functions j, to have a continuous derivative, and also to be supported over three intervals per spline, as seen in the middle plot in Figure The interpolant takes the form S (x) n  c j, j, (x), j with coefficients specified by n + equations in n + unknowns: (), (x ), (x ) n, (x ), (x ), (x ) n, (x ), (x n ), (x n ) n, (x n ) c, c, c n, f f f n Since there are more variables than constraints, we expect infinitely many quadratic splines that interpolate the data Evaluate the entries of the matrix in () First note that j, (x`), ` {j +, j + }, so the matrix is zero in all entries except the main diagonal ( j, (x j+ )) and the first superdiagonal ( j, (x j+ )) To evaluate these nonzero entries, recall that the recursion () for -splines gives x xj xj+ x j, (x) x j, (x)+ j x j+, (x) j+ x j+ x j+ Evaluate this function at x j+ and x j+, using our knowledge of the
8 j, linear -splines ( hat functions ): j, (x j+ ) j, (x j+ ) xj+ x j+ xj+ x j+ xj+ x j+ xj+ x j+ x j xj+ x j+ x j, (x j+ )+ j x j+, (x j+ ) j+ x j x j x j+ xj+ x j+ + x j+ x j ; x j+ x j+ x j+ x j x j xj+ x j+ x j, (x j+ )+ j x j+, (x j+ ) j+ x j x j x j+ xj+ x j+ + x j+ x j+ x j+ x j+ x j+ x j+ Use these formulas to populate the superdiagonal and subdiagonal of the matrix in () In the (important) special case of uniformly spaced knots gives the particularly simple formulas x j x + jh, for fixed h >, j, (x j+ ) j, (x j+ ), hence the system () becomes / / / / / / c, c, c, f f f n, c n, where the blank entries are zero This (n + ) (n + ) system will have infinitely many solutions, ie, infinitely many splines that satisfy the interpolation conditions How to choose among them? Impose one extra condition, such as S (x ) or S (x n) As an example, let us work through the condition S (x ); it raises an interesting issue Refer to the middle plot in Figure Due to the small support of the quadratic -splines, j, (x ) for j >, so (8) S (x )c,, (x )+c,, (x )+c,, (x ) The derivatives of the -splines at knots are tricky to compute Differentiating the recurrence () with k, we can formally write j, (x) x j+ x xj x j, (x)+ j, j x j+ x (x) j x j+ xj+ x x j+, (x)+ j+, j+ x j+ x (x) j+
CS 450 Numerical Analysis. Chapter 7: Interpolation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationHandout 4 - Interpolation Examples
Handout 4 - Interpolation Examples Middle East Technical University Example 1: Obtaining the n th Degree Newton s Interpolating Polynomial Passing through (n+1) Data Points Obtain the 4 th degree Newton
More informationConcept of Curve Fitting Difference with Interpolation
Curve Fitting Content Concept of Curve Fitting Difference with Interpolation Estimation of Linear Parameters by Least Squares Curve Fitting by Polynomial Least Squares Estimation of Non-linear Parameters
More informationNatural Quartic Spline
Natural Quartic Spline Rafael E Banchs INTRODUCTION This report describes the natural quartic spline algorithm developed for the enhanced solution of the Time Harmonic Field Electric Logging problem As
More informationConsider functions such that then satisfies these properties: So is represented by the cubic polynomials on on and on.
1 of 9 3/1/2006 2:28 PM ne previo Next: Trigonometric Interpolation Up: Spline Interpolation Previous: Piecewise Linear Case Cubic Splines A piece-wise technique which is very popular. Recall the philosophy
More informationSet 5, Total points: 100 Issued: week of
Prof. P. Koumoutsakos Prof. Dr. Jens Walther ETH Zentrum, CLT F 1, E 11 CH-809 Zürich Models, Algorithms and Data (MAD): Introduction to Computing Spring semester 018 Set 5, Total points: 100 Issued: week
More informationRemark. Jacobs University Visualization and Computer Graphics Lab : ESM4A - Numerical Methods 331
Remark Reconsidering the motivating example, we observe that the derivatives are typically not given by the problem specification. However, they can be estimated in a pre-processing step. A good estimate
More informationspecified or may be difficult to handle, we often have a tabulated data
Interpolation Introduction In many practical situations, for a function which either may not be explicitly specified or may be difficult to handle, we often have a tabulated data where and for In such
More informationComputational Physics PHYS 420
Computational Physics PHYS 420 Dr Richard H. Cyburt Assistant Professor of Physics My office: 402c in the Science Building My phone: (304) 384-6006 My email: rcyburt@concord.edu My webpage: www.concord.edu/rcyburt
More informationLecture VIII. Global Approximation Methods: I
Lecture VIII Global Approximation Methods: I Gianluca Violante New York University Quantitative Macroeconomics G. Violante, Global Methods p. 1 /29 Global function approximation Global methods: function
More informationAn introduction to interpolation and splines
An introduction to interpolation and splines Kenneth H. Carpenter, EECE KSU November 22, 1999 revised November 20, 2001, April 24, 2002, April 14, 2004 1 Introduction Suppose one wishes to draw a curve
More informationFinite Element Analysis Prof. Dr. B. N. Rao Department of Civil Engineering Indian Institute of Technology, Madras. Lecture - 24
Finite Element Analysis Prof. Dr. B. N. Rao Department of Civil Engineering Indian Institute of Technology, Madras Lecture - 24 So in today s class, we will look at quadrilateral elements; and we will
More informationME 261: Numerical Analysis Lecture-12: Numerical Interpolation
1 ME 261: Numerical Analysis Lecture-12: Numerical Interpolation Md. Tanver Hossain Department of Mechanical Engineering, BUET http://tantusher.buet.ac.bd 2 Inverse Interpolation Problem : Given a table
More information2D Spline Curves. CS 4620 Lecture 13
2D Spline Curves CS 4620 Lecture 13 2008 Steve Marschner 1 Motivation: smoothness In many applications we need smooth shapes [Boeing] that is, without discontinuities So far we can make things with corners
More informationEngineering Analysis ENG 3420 Fall Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00
Engineering Analysis ENG 3420 Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00 1 Lecture 24 Attention: The last homework HW5 and the last project are due on Tuesday November
More informationPolynomials tend to oscillate (wiggle) a lot, even when our true function does not.
AMSC/CMSC 460 Computational Methods, Fall 2007 UNIT 2: Spline Approximations Dianne P O Leary c 2001, 2002, 2007 Piecewise polynomial interpolation Piecewise polynomial interpolation Read: Chapter 3 Skip:
More information8 Piecewise Polynomial Interpolation
Applied Math Notes by R. J. LeVeque 8 Piecewise Polynomial Interpolation 8. Pitfalls of high order interpolation Suppose we know the value of a function at several points on an interval and we wish to
More informationLecture 8. Divided Differences,Least-Squares Approximations. Ceng375 Numerical Computations at December 9, 2010
Lecture 8, Ceng375 Numerical Computations at December 9, 2010 Computer Engineering Department Çankaya University 8.1 Contents 1 2 3 8.2 : These provide a more efficient way to construct an interpolating
More informationSee the course website for important information about collaboration and late policies, as well as where and when to turn in assignments.
COS Homework # Due Tuesday, February rd See the course website for important information about collaboration and late policies, as well as where and when to turn in assignments. Data files The questions
More informationCubic spline interpolation
Cubic spline interpolation In the following, we want to derive the collocation matrix for cubic spline interpolation. Let us assume that we have equidistant knots. To fulfill the Schoenberg-Whitney condition
More informationLecture 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 informationNumerical Integration
Numerical Integration Numerical Integration is the process of computing the value of a definite integral, when the values of the integrand function, are given at some tabular points. As in the case of
More informationHomework #6 Brief Solutions 2012
Homework #6 Brief Solutions %page 95 problem 4 data=[-,;-,;,;4,] data = - - 4 xk=data(:,);yk=data(:,);s=csfit(xk,yk,-,) %Using the program to find the coefficients S =.456 -.456 -.. -.5.9 -.5484. -.58.87.
More information2D 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 informationCS130 : Computer Graphics Curves (cont.) Tamar Shinar Computer Science & Engineering UC Riverside
CS130 : Computer Graphics Curves (cont.) Tamar Shinar Computer Science & Engineering UC Riverside Blending Functions Blending functions are more convenient basis than monomial basis canonical form (monomial
More informationFall CSCI 420: Computer Graphics. 4.2 Splines. Hao Li.
Fall 2014 CSCI 420: Computer Graphics 4.2 Splines Hao Li http://cs420.hao-li.com 1 Roller coaster Next programming assignment involves creating a 3D roller coaster animation We must model the 3D curve
More informationFitting to a set of data. Lecture on fitting
Fitting to a set of data Lecture on fitting Linear regression Linear regression Residual is the amount difference between a real data point and a modeled data point Fitting a polynomial to data Could use
More informationSplines. Parameterization of a Curve. Curve Representations. Roller coaster. What Do We Need From Curves in Computer Graphics? Modeling Complex Shapes
CSCI 420 Computer Graphics Lecture 8 Splines Jernej Barbic University of Southern California Hermite Splines Bezier Splines Catmull-Rom Splines Other Cubic Splines [Angel Ch 12.4-12.12] Roller coaster
More informationDesign considerations
Curves Design considerations local control of shape design each segment independently smoothness and continuity ability to evaluate derivatives stability small change in input leads to small change in
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 informationPolynomial Approximation and Interpolation Chapter 4
4.4 LAGRANGE POLYNOMIALS The direct fit polynomial presented in Section 4.3, while quite straightforward in principle, has several disadvantages. It requires a considerable amount of effort to solve the
More informationLecture 9. Curve fitting. Interpolation. Lecture in Numerical Methods from 28. April 2015 UVT. Lecture 9. Numerical. Interpolation his o
Curve fitting. Lecture in Methods from 28. April 2015 to ity Interpolation FIGURE A S Splines Piecewise relat UVT Agenda of today s lecture 1 Interpolation Idea 2 3 4 5 6 Splines Piecewise Interpolation
More informationCurve fitting using linear models
Curve fitting using linear models Rasmus Waagepetersen Department of Mathematics Aalborg University Denmark September 28, 2012 1 / 12 Outline for today linear models and basis functions polynomial regression
More informationInterpolation - 2D mapping Tutorial 1: triangulation
Tutorial 1: triangulation Measurements (Zk) at irregular points (xk, yk) Ex: CTD stations, mooring, etc... The known Data How to compute some values on the regular spaced grid points (+)? The unknown data
More informationMA 323 Geometric Modelling Course Notes: Day 10 Higher Order Polynomial Curves
MA 323 Geometric Modelling Course Notes: Day 10 Higher Order Polynomial Curves David L. Finn December 14th, 2004 Yesterday, we introduced quintic Hermite curves as a higher order variant of cubic Hermite
More informationNonparametric regression using kernel and spline methods
Nonparametric regression using kernel and spline methods Jean D. Opsomer F. Jay Breidt March 3, 016 1 The statistical model When applying nonparametric regression methods, the researcher is interested
More informationEvaluating the polynomial at a point
Evaluating the polynomial at a point Recall that we have a data structure for each piecewise polynomial (linear, quadratic, cubic and cubic Hermite). We have a routine that sets evenly spaced interpolation
More informationImportant Properties of B-spline Basis Functions
Important Properties of B-spline Basis Functions P2.1 N i,p (u) = 0 if u is outside the interval [u i, u i+p+1 ) (local support property). For example, note that N 1,3 is a combination of N 1,0, N 2,0,
More informationKnowledge Discovery and Data Mining
Knowledge Discovery and Data Mining Basis Functions Tom Kelsey School of Computer Science University of St Andrews http://www.cs.st-andrews.ac.uk/~tom/ tom@cs.st-andrews.ac.uk Tom Kelsey ID5059-02-BF 2015-02-04
More informationAdvanced Graphics. Beziers, B-splines, and NURBS. Alex Benton, University of Cambridge Supported in part by Google UK, Ltd
Advanced Graphics Beziers, B-splines, and NURBS Alex Benton, University of Cambridge A.Benton@damtp.cam.ac.uk Supported in part by Google UK, Ltd Bezier splines, B-Splines, and NURBS Expensive products
More informationA Practical Review of Uniform B-Splines
A Practical Review of Uniform B-Splines Kristin Branson A B-spline is a convenient form for representing complicated, smooth curves. A uniform B-spline of order k is a piecewise order k Bezier curve, and
More information1D Regression. i.i.d. with mean 0. Univariate Linear Regression: fit by least squares. Minimize: to get. The set of all possible functions is...
1D Regression i.i.d. with mean 0. Univariate Linear Regression: fit by least squares. Minimize: to get. The set of all possible functions is... 1 Non-linear problems What if the underlying function is
More information99 International Journal of Engineering, Science and Mathematics
Journal Homepage: Applications of cubic splines in the numerical solution of polynomials Najmuddin Ahmad 1 and Khan Farah Deeba 2 Department of Mathematics Integral University Lucknow Abstract: In this
More informationInteractive 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 informationRational Bezier Surface
Rational Bezier Surface The perspective projection of a 4-dimensional polynomial Bezier surface, S w n ( u, v) B i n i 0 m j 0, u ( ) B j m, v ( ) P w ij ME525x NURBS Curve and Surface Modeling Page 97
More informationParametric 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 informationPiecewise Polynomial Interpolation, cont d
Jim Lambers MAT 460/560 Fall Semester 2009-0 Lecture 2 Notes Tese notes correspond to Section 4 in te text Piecewise Polynomial Interpolation, cont d Constructing Cubic Splines, cont d Having determined
More informationChapter 3. Numerical Differentiation, Interpolation, and Integration. Instructor: Dr. Ming Ye
Chapter 3 Numerical Differentiation, Interpolation, and Integration Instructor: Dr. Ming Ye Measuring Flow in Natural Channels Mean-Section Method (1) Divide the stream into a number of rectangular elements
More informationLECTURE NOTES - SPLINE INTERPOLATION. 1. Introduction. Problems can arise when a single high-degree polynomial is fit to a large number
LECTURE NOTES - SPLINE INTERPOLATION DR MAZHAR IQBAL 1 Introduction Problems can arise when a single high-degree polynomial is fit to a large number of points High-degree polynomials would obviously pass
More informationMultiple-Choice Test Spline Method Interpolation COMPLETE SOLUTION SET
Multiple-Choice Test Spline Method Interpolation COMPLETE SOLUTION SET 1. The ollowing n data points, ( x ), ( x ),.. ( x, ) 1, y 1, y n y n quadratic spline interpolation the x-data needs to be (A) equally
More informationScientific Computing: Interpolation
Scientific Computing: Interpolation Aleksandar Donev Courant Institute, NYU donev@courant.nyu.edu Course MATH-GA.243 or CSCI-GA.22, Fall 25 October 22nd, 25 A. Donev (Courant Institute) Lecture VIII /22/25
More informationAMS527: Numerical Analysis II
AMS527: Numerical Analysis II A Brief Overview of Finite Element Methods Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao SUNY Stony Brook AMS527: Numerical Analysis II 1 / 25 Overview Basic concepts Mathematical
More informationLeast-Squares Fitting of Data with B-Spline Curves
Least-Squares Fitting of Data with B-Spline Curves David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International
More informationInterpolation & Polynomial Approximation. Cubic Spline Interpolation II
Interpolation & Polynomial Approximation Cubic Spline Interpolation II Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University
More informationInterpolation. TANA09 Lecture 7. Error analysis for linear interpolation. Linear Interpolation. Suppose we have a table x x 1 x 2...
TANA9 Lecture 7 Interpolation Suppose we have a table x x x... x n+ Interpolation Introduction. Polynomials. Error estimates. Runge s phenomena. Application - Equation solving. Spline functions and interpolation.
More informationLinear Interpolating Splines
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 17 Notes Tese notes correspond to Sections 112, 11, and 114 in te text Linear Interpolating Splines We ave seen tat ig-degree polynomial interpolation
More informationCS321 Introduction To Numerical Methods
CS3 Introduction To Numerical Methods Fuhua (Frank) Cheng Department of Computer Science University of Kentucky Lexington KY 456-46 - - Table of Contents Errors and Number Representations 3 Error Types
More informationLecture 2.2 Cubic Splines
Lecture. Cubic Splines Cubic Spline The equation for a single parametric cubic spline segment is given by 4 i t Bit t t t i (..) where t and t are the parameter values at the beginning and end of the segment.
More informationFour equations are necessary to evaluate these coefficients. Eqn
1.2 Splines 11 A spline function is a piecewise defined function with certain smoothness conditions [Cheney]. A wide variety of functions is potentially possible; polynomial functions are almost exclusively
More information08 - 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 informationEfficient Degree Elevation and Knot Insertion for B-spline Curves using Derivatives
Efficient Degree Elevation and Knot Insertion for B-spline Curves using Derivatives Qi-Xing Huang a Shi-Min Hu a,1 Ralph R Martin b a Department of Computer Science and Technology, Tsinghua University,
More informationAssignment 4: Mesh Parametrization
CSCI-GA.3033-018 - Geometric Modeling Assignment 4: Mesh Parametrization In this exercise you will Familiarize yourself with vector field design on surfaces. Create scalar fields whose gradients align
More informationCAP 6736 Geometric Modeling Team Hamilton B-Spline Basis Functions. Presented by Padmavathi Siddi Vigneshkumar Suresh Jorge Medrano
CAP 6736 Geometric Modeling Team Hamilton B-Spline Basis Functions Presented by Padmavathi Siddi Vigneshkumar Suresh Jorge Medrano 1 Team members contributions Member: Padmavathi Siddi Piecewise Polynomials
More informationFebruary 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 informationMid-Chapter Quiz: Lessons 2-1 through 2-3
Graph and analyze each function. Describe its domain, range, intercepts, end behavior, continuity, and where the function is increasing or decreasing. 1. f (x) = 2x 3 2 16 1.5 6.75 1 2 0 0 1 2 1.5 6.75
More informationRegularity Analysis of Non Uniform Data
Regularity Analysis of Non Uniform Data Christine Potier and Christine Vercken Abstract. A particular class of wavelet, derivatives of B-splines, leads to fast and ecient algorithms for contours detection
More informationParametric 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 informationCS130 : Computer Graphics Curves. Tamar Shinar Computer Science & Engineering UC Riverside
CS130 : Computer Graphics Curves Tamar Shinar Computer Science & Engineering UC Riverside Design considerations local control of shape design each segment independently smoothness and continuity ability
More informationSpline Methods Draft. Tom Lyche and Knut Mørken
Spline Methods Draft Tom Lyche and Knut Mørken 24th May 2002 2 Contents 1 Splines and B-splines an introduction 3 1.1 Convex combinations and convex hulls..................... 3 1.1.1 Stable computations...........................
More informationCentral 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 informationBezier Curves, B-Splines, NURBS
Bezier Curves, B-Splines, NURBS Example Application: Font Design and Display Curved objects are everywhere There is always need for: mathematical fidelity high precision artistic freedom and flexibility
More informationLinear Arrays. Chapter 7
Linear Arrays Chapter 7 1. Basics for the linear array computational model. a. A diagram for this model is P 1 P 2 P 3... P k b. It is the simplest of all models that allow some form of communication between
More informationA 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 informationTable for Third-Degree Spline Interpolation Using Equi-Spaced Knots. By W. D. Hoskins
MATHEMATICS OF COMPUTATION, VOLUME 25, NUMBER 116, OCTOBER, 1971 Table for Third-Degree Spline Interpolation Using Equi-Spaced Knots By W. D. Hoskins Abstract. A table is given for the calculation of the
More informationPS Geometric Modeling Homework Assignment Sheet I (Due 20-Oct-2017)
Homework Assignment Sheet I (Due 20-Oct-2017) Assignment 1 Let n N and A be a finite set of cardinality n = A. By definition, a permutation of A is a bijective function from A to A. Prove that there exist
More informationCS348a: Computer Graphics Handout #24 Geometric Modeling Original Handout #20 Stanford University Tuesday, 27 October 1992
CS348a: Computer Graphics Handout #24 Geometric Modeling Original Handout #20 Stanford University Tuesday, 27 October 1992 Original Lecture #9: 29 October 1992 Topics: B-Splines Scribe: Brad Adelberg 1
More informationCubic Splines and Matlab
Cubic Splines and Matlab October 7, 2006 1 Introduction In this section, we introduce the concept of the cubic spline, and how they are implemented in Matlab. Of particular importance are the new Matlab
More informationFebruary 2017 (1/20) 2 Piecewise Polynomial Interpolation 2.2 (Natural) Cubic Splines. MA378/531 Numerical Analysis II ( NA2 )
f f f f f (/2).9.8.7.6.5.4.3.2. S Knots.7.6.5.4.3.2. 5 5.2.8.6.4.2 S Knots.2 5 5.9.8.7.6.5.4.3.2..9.8.7.6.5.4.3.2. S Knots 5 5 S Knots 5 5 5 5.35.3.25.2.5..5 5 5.6.5.4.3.2. 5 5 4 x 3 3.5 3 2.5 2.5.5 5
More informationInterpolation by Spline Functions
Interpolation by Spline Functions Com S 477/577 Sep 0 007 High-degree polynomials tend to have large oscillations which are not the characteristics of the original data. To yield smooth interpolating curves
More informationSplines and penalized regression
Splines and penalized regression November 23 Introduction We are discussing ways to estimate the regression function f, where E(y x) = f(x) One approach is of course to assume that f has a certain shape,
More informationDiscrete Cubic Interpolatory Splines
Publ RIMS, Kyoto Univ. 28 (1992), 825-832 Discrete Cubic Interpolatory Splines By Manjulata SHRIVASTAVA* Abstract In the present paper, existence, uniqueness and convergence properties of a discrete cubic
More informationA popular method for moving beyond linearity. 2. Basis expansion and regularization 1. Examples of transformations. Piecewise-polynomials and splines
A popular method for moving beyond linearity 2. Basis expansion and regularization 1 Idea: Augment the vector inputs x with additional variables which are transformation of x use linear models in this
More informationErasing Haar Coefficients
Recap Haar simple and fast wavelet transform Limitations not smooth enough: blocky How to improve? classical approach: basis functions Lifting: transforms 1 Erasing Haar Coefficients 2 Page 1 Classical
More informationStudent Outcomes. Classwork. Discussion (10 minutes)
Student Outcomes Students know the definition of a number raised to a negative exponent. Students simplify and write equivalent expressions that contain negative exponents. Classwork Discussion (10 minutes)
More informationB(asis) Splines. Ashish Myles CISE, UF
B(asis) Splines Ashish Myles CISE, UF Splines Piecewise polynomial More flexible than single polynomials can have finite support can be periodic Degree d splines typically C d 1 continuity Some polynomial
More informationCHAPTER 6 Parametric Spline Curves
CHAPTER 6 Parametric Spline Curves When we introduced splines in Chapter 1 we focused on spline curves, or more precisely, vector valued spline functions. In Chapters 2 and 4 we then established the basic
More informationA general matrix representation for non-uniform B-spline subdivision with boundary control
A general matrix representation for non-uniform B-spline subdivision with boundary control G. Casciola a, L. Romani a a Department of Mathematics, University of Bologna, P.zza di Porta San Donato 5, 40127
More informationParameterization. Michael S. Floater. November 10, 2011
Parameterization Michael S. Floater November 10, 2011 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to generate from point
More informationLecture notes on the simplex method September We will present an algorithm to solve linear programs of the form. maximize.
Cornell University, Fall 2017 CS 6820: Algorithms Lecture notes on the simplex method September 2017 1 The Simplex Method We will present an algorithm to solve linear programs of the form maximize subject
More informationCurves and Surfaces for Computer-Aided Geometric Design
Curves and Surfaces for Computer-Aided Geometric Design A Practical Guide Fourth Edition Gerald Farin Department of Computer Science Arizona State University Tempe, Arizona /ACADEMIC PRESS I San Diego
More informationLecture 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 informationChapter 3. Interpolation. 3.1 Introduction
Chapter 3 Interpolation 3 Introduction One of the fundamental problems in Numerical Methods is the problem of interpolation, that is given a set of data points ( k, k ) for k =,, n, how do we find a function
More informationAPPM/MATH Problem Set 4 Solutions
APPM/MATH 465 Problem Set 4 Solutions This assignment is due by 4pm on Wednesday, October 16th. You may either turn it in to me in class on Monday or in the box outside my office door (ECOT 35). Minimal
More informationSpline Methods Draft. Tom Lyche and Knut Mørken
Spline Methods Draft Tom Lyche and Knut Mørken January 5, 2005 2 Contents 1 Splines and B-splines an Introduction 3 1.1 Convex combinations and convex hulls.................... 3 1.1.1 Stable computations...........................
More informationCOMP3421. Global Lighting Part 2: Radiosity
COMP3421 Global Lighting Part 2: Radiosity Recap: Global Lighting The lighting equation we looked at earlier only handled direct lighting from sources: We added an ambient fudge term to account for all
More informationFinite Element Analysis Prof. Dr. B. N. Rao Department of Civil Engineering Indian Institute of Technology, Madras. Lecture - 36
Finite Element Analysis Prof. Dr. B. N. Rao Department of Civil Engineering Indian Institute of Technology, Madras Lecture - 36 In last class, we have derived element equations for two d elasticity problems
More informationVideo 11.1 Vijay Kumar. Property of University of Pennsylvania, Vijay Kumar
Video 11.1 Vijay Kumar 1 Smooth three dimensional trajectories START INT. POSITION INT. POSITION GOAL Applications Trajectory generation in robotics Planning trajectories for quad rotors 2 Motion Planning
More informationNeed for Parametric Equations
Curves and Surfaces Curves and Surfaces Need for Parametric Equations Affine Combinations Bernstein Polynomials Bezier Curves and Surfaces Continuity when joining curves B Spline Curves and Surfaces Need
More informationJustify all your answers and write down all important steps. Unsupported answers will be disregarded.
Numerical Analysis FMN011 2017/05/30 The exam lasts 5 hours and has 15 questions. A minimum of 35 points out of the total 70 are required to get a passing grade. These points will be added to those you
More informationSpline Methods Draft. Tom Lyche and Knut Mørken. Department of Informatics Centre of Mathematics for Applications University of Oslo
Spline Methods Draft Tom Lyche and Knut Mørken Department of Informatics Centre of Mathematics for Applications University of Oslo January 27, 2006 Contents 1 Splines and B-splines an Introduction 1 1.1
More information