CSCE 441 Lecture 29

From Notes
Jump to navigation Jump to search

« previous | Monday, March 31, 2014 | next »


No class Wednesday

Smooth Curves

Represented as polynomials:

Power Basis

We can mess with coefficients, but it's hard to predict what the shape will look like just by modifiying coefficients.

Not intuitive.

Interpolation

Find a polynomial that passes through the specified values

Interpolate for each component and .


Lagrange Interpolation

Identical to matrix method, but uses a (recursive) geometric construction


Start with line from to :

Add line from to :

What about quadratic?

Find linear interpolation between two points: given points and with values and , respectively, the linear interpolation of over is given by

In our example,

What about cubic through 4 points?

  • find quadratic of first 3 points
  • find quadratic of last 3 points
  • find linear interpolation of both functions

Basis: linear interpolation between two points

Induction:

  • Assume we have points
  • Build polynomial interpolating polynomials , of degree for and


Problem: artifacts (oscillation) formed by pulling a single point out of line.


Bezier Curves

Polynomial curves that seek to approximate rather than interpolate.

Bernstein Polynomials

  • Degree 1: ,
  • Degree 2: , ,
  • Degree 3: , , ,
  • Degree : for .


Bezier curves are just for control points

Properties

  • Interpolates endpoints exactly
  • tangent at endpoints is in direction of first and last edge
  • curve lies within the convex hull of the control points