610 likes | 1.04k Views
Curves and Interpolation. Dr. Scott Schaefer. Smooth Curves. How do we create smooth curves?. Smooth Curves. How do we create smooth curves? Parametric curves with polynomials. Smooth Curves. Controlling the shape of the curve. Smooth Curves. Controlling the shape of the curve.
E N D
Curves and Interpolation Dr. Scott Schaefer
Smooth Curves • How do we create smooth curves?
Smooth Curves • How do we create smooth curves? • Parametric curves with polynomials
Smooth Curves • Controlling the shape of the curve
Smooth Curves • Controlling the shape of the curve
Smooth Curves • Controlling the shape of the curve
Smooth Curves • Controlling the shape of the curve
Smooth Curves • Controlling the shape of the curve
Smooth Curves • Controlling the shape of the curve
Smooth Curves • Controlling the shape of the curve
Smooth Curves • Controlling the shape of the curve
Smooth Curves • Controlling the shape of the curve
Smooth Curves • Controlling the shape of the curve Power-basis coefficients not intuitive for controlling shape of curve!!!
Interpolation • Find a polynomial y(t) such that y(ti)=yi
Interpolation • Find a polynomial y(t) such that y(ti)=yi
Interpolation • Find a polynomial y(t) such that y(ti)=yi basis
Interpolation • Find a polynomial y(t) such that y(ti)=yi coefficients
Interpolation • Find a polynomial y(t) such that y(ti)=yi
Interpolation • Find a polynomial y(t) such that y(ti)=yi Vandermonde matrix
Interpolation • Find a polynomial y(t) such that y(ti)=yi
Interpolation • Find a polynomial y(t) such that y(ti)=yi
Interpolation • Find a polynomial y(t) such that y(ti)=yi Intuitive control of curve using “control points”!!!
Interpolation • Perform interpolation for each component separately • Combine result to obtain parametric curve
Interpolation • Perform interpolation for each component separately • Combine result to obtain parametric curve
Interpolation • Perform interpolation for each component separately • Combine result to obtain parametric curve
Generalized Vandermonde Matrices • Assume different basis functions fi(t)
LaGrange Polynomials • Explicit form for interpolating polynomial!
1 0.8 0.6 0.4 0.2 1.5 2 2.5 3 3.5 4 -0.2 LaGrange Polynomials • Explicit form for interpolating polynomial!
1 0.8 0.6 0.4 0.2 1.5 2 2.5 3 3.5 4 -0.2 LaGrange Polynomials • Explicit form for interpolating polynomial!
1 0.8 0.6 0.4 0.2 1.5 2 2.5 3 3.5 4 -0.2 LaGrange Polynomials • Explicit form for interpolating polynomial!
1 0.8 0.6 0.4 0.2 1.5 2 2.5 3 3.5 4 -0.2 LaGrange Polynomials • Explicit form for interpolating polynomial!
LaGrange Polynomials • Explicit form for interpolating polynomial!
Neville’s Algorithm • Identical to matrix method but uses a geometric construction
Neville’s Algorithm • Identical to matrix method but uses a geometric construction
Neville’s Algorithm • Identical to matrix method but uses a geometric construction
Neville’s Algorithm • Identical to matrix method but uses a geometric construction
Neville’s Algorithm • Identical to matrix method but uses a geometric construction
Neville’s Algorithm • Identical to matrix method but uses a geometric construction
Neville’s Algorithm • Identical to matrix method but uses a geometric construction
Neville’s Algorithm • Identical to matrix method but uses a geometric construction
Neville’s Algorithm • Identical to matrix method but uses a geometric construction
Neville’s Algorithm • Identical to matrix method but uses a geometric construction
Neville’s Algorithm • Identical to matrix method but uses a geometric construction
Neville’s Algorithm • Identical to matrix method but uses a geometric construction
Neville’s Algorithm • Identical to matrix method but uses a geometric construction
Neville’s Algorithm • Claim: The polynomial produced by Neville’s algorithm is unique
Neville’s Algorithm • Claim: The polynomial produced by Neville’s algorithm is unique • Proof: Assume that there are two degree n polynomials such that a(ti)=b(ti)=yi for i=0…n.