Anupam Saxena Associate Professor Indian Institute of Technology KANPUR 208016.

Slides:



Advertisements
Similar presentations
Notes 6.6 Fundamental Theorem of Algebra
Advertisements

Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Warm up Use synthetic division to divide (4x3 – 3x2 + 2x + 1)/ (x – 1) (x3 – x2 – 6)/(x + 2)
Computer Aided Engineering Design
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Interpolation A method of constructing a function that crosses through a discrete set of known data points. .
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Selected from presentations by Jim Ramsay, McGill University, Hongliang Fei, and Brian Quanz Basis Basics.
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
Bezier Curves and Splines David Eno MAT 499 Fall ‘06.
Numerical Analysis –Interpolation
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Informationsteknologi Monday, December 10, 2007Computer Graphics - Class 161 Today’s class Curve fitting Evaluators Surfaces.
CS CS 175 – Week 8 Bézier Curves Definition, Algorithms.
1 Dr. Scott Schaefer The Bernstein Basis and Bezier Curves.
1 Dr. Scott Schaefer Catmull-Rom Splines: Combining B-splines and Interpolation.
Bezier and Spline Curves and Surfaces Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico.
RASTER CONVERSION ALGORITHMS FOR CURVES: 2D SPLINES 2D Splines - Bézier curves - Spline curves.
Bezier and Spline Curves and Surfaces CS4395: Computer Graphics 1 Mohan Sridharan Based on slides created by Edward Angel.
CS Subdivision I: The Univariate Setting Peter Schröder.
Subdivision Analysis via JSR We already know the z-transform formulation of schemes: To check if the scheme generates a continuous limit curve ( the scheme.
EXAMPLE 2 Find all zeros of f (x) = x 5 – 4x 4 + 4x x 2 – 13x – 14. SOLUTION STEP 1 Find the rational zeros of f. Because f is a polynomial function.
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
9.2 Taylor Series Quick Review Find a formula for the nth derivative of the function.
A D V A N C E D C O M P U T E R G R A P H I C S CMSC 635 January 15, 2013 Spline curves 1/23 Curves and Surfaces.
Introduction to Computer Graphics with WebGL
1 Dr. Scott Schaefer Smooth Curves. 2/109 Smooth Curves Interpolation  Interpolation through Linear Algebra  Lagrange interpolation Bezier curves B-spline.
Review of Interpolation. A method of constructing a function that crosses through a discrete set of known data points.
Lifting Part 2: Subdivision Ref: SIGGRAPH96. Subdivision Methods On constructing more powerful predictors …
Splines Vida Movahedi January 2007.
Cornell CS465 Fall 2004 Lecture 15© 2004 Steve Marschner 1 2D Spline Curves CS 465 Lecture 15.
Dividing Polynomials & The Remainder Theorem. Dividing Polynomials When dividing a polynomial by a monomial, divide each term in the polynomial by the.
Zeros of Polynomials 2.5.
EE3561_Unit 5(c)AL-DHAIFALLAH14361 EE 3561 : Computational Methods Unit 5 : Interpolation Dr. Mujahed AlDhaifallah (Term 351) Read Chapter 18, Sections.
Section 5.5 The Real Zeros of a Polynomial Function.
6-2 Polynomials and Linear Factors. Standard and Factored Form  Standard form means to write it as a simplified (multiplied out) polynomial starting.
FINDING A POLYNOMIAL PASSING THROUGH A POINT. Review: the Linear Factorization Theorem If where n > 1 and a n ≠ 0 then Where c 1, c 2, … c n are complex.
Parametric Curves CS 318 Interactive Computer Graphics John C. Hart.
By: Mark Coose Joetta Swift Micah Weiss. What Problems Can Interpolation Solve? Given a table of values, find a simple function that passes through the.
THOERY OF MECHANISMS AND MACHINES
THOERY OF MECHANISMS AND MACHINES Module-05 Velocity & Acceleration Analysis Instructed by: Dr. Anupam Saxena Associate Professor Department of Mechanical.
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
Conjugate Pairs Theorem Every complex polynomial function of degree n  1 has exactly n complex zeros, some of which may repeat. 1) A polynomial function.
Curves University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2013 Tamara Munzner.
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
College Algebra Chapter 3 Polynomial and Rational Functions Section 3.3 Division of Polynomials and the Remainder and Factor Theorems.
Solving Polynomial Equations A-APR.3 Identify zeros of polynomials when suitable factorizations are available, and use the zeros to construct a rough graph.
Warm Up Compute the following by using long division.
Algebra II 5.6: Find Rational Zeros HW tonight: p.374 (4-10 even)
Descartes Rule of Signs Positive real zeros = Negative real zeros =
Polynomial Division Ex..
Class Notes 7: High Order Linear Differential Equation Homogeneous
2.5 Zeros of Polynomial Functions
5-5 Theorems About Roots of Polynomial Equations
Polynomial Division Ex..
Zeros of a Polynomial Function
Spline Interpolation Class XVII.
Curve design 455.
Fundamental Theorem of Algebra
Numerical Analysis Lecture 26.
5.3 Higher-Order Taylor Methods
Lecture 21: B Spline Curve
The Real Zeros of a Polynomial Function
INTERPOLATION For both irregulary spaced and evenly spaced data.
Dividing Polynomials (Long Division)
4-3: Remainder and Factor Theorems
Dividing Polynomials (Long Division)
Computer Aided Geometric Design Mika Hirsch
Presentation transcript:

Anupam Saxena Associate Professor Indian Institute of Technology KANPUR

(tj  t)m1+(tj  t)m1+ tjtj t f(t j ; t) = (t j  t) m  1 + is continuous at t = t j and so are its derivatives up to m  2 (t j  t) m  1 + is a spline of order m An nth order (n  1 degree) spline is C n-2 continuous

Since each truncated power function is a spline, their weighted linear combination will be a spline of order m treat t as constant and compute the m th divided difference using s = t i  m, t i  m+1, …, t i, mth divided difference of the truncated function f(s; t) = (s  t) m  1 + B  spline basis function w(t) = (t  t i  m )(t  t i  m+1 )… (t  t i ) and w ’ (t) = dw/dt

t > tit > ti  (t) = 0 (t i+r  m  t) m  1 +, r = 0, …, m are all zero t  t i-m  (t) = 0  (t) is the m th divided difference of a pure (m  1) degree polynomial  (t) is standardized Peano’s theorem g(t) = t m, g m (t) = (m)! mth divided difference of t m is 1 An nth order (n  1 degree) spline is C n-2 continuous

divided differences of the product of two functions, h(t) = f(t)g(t) h[t 0, t 1,…,t k ] = f[t 0, t 1, …,t r ] g[t r, t r+1, …,t k ] = f[t 0 ]g[t 0, t 1, …,t k ] + f[t 0, t 1 ]g[t 1, …,t k ] + … + f[t 0, t 1, …,t k  1 ]g[t k  1,t k ] + f[t 0, t 1, …,t k ] g[t k ] h k (t j ; t) = (t j  t) k  1 + = (t j  t) k  2 + (t j  t) + = h k  1 (t j ; t) (t j  t) +

h k [t i  k,..., t i ;t ] = h k  1 [t i  k,…, t i  1 ;t] + h k  1 [t i  k,…, t i ;t](t i  t) k th divided difference of (t j  t) k  1 + : B-spline M k, i (t) M k-1,i-1 (t)

h k [t i  k,..., t i ;t ] = h k  1 [t i  k,…, t i  1 ;t] + h k  1 [t i  k,…, t i ;t](t i  t) M k, i (t)M k  1,i  1 (t) + {h k  1 [t i  k+1,…, t i ;t ]  h k  1 [t i  k,…, t i  1 ;t]} = {M k  1, i (t)  M k  1, i  1 (t)} M k, i (t) + = M k  1,i  1 (t) M k, i (t) = M k  1,i  1 (t) + M k  1, i (t) similar to the de Casteljau’s algorithm repeated linear interpolation is performed between two consecutive splines a table to construct splines may also be generated