CS 284: CAGD 
Lecture #3 -- Tu 9/05, 2006.

PREVIOUS < - - - - > CS 284 HOME < - - - - > CURRENT < - - - - > NEXT


Read:  RC pp 49-73.

Warm-up Exercise: Draw Bézier Curves ...

Lecture Topics:  Bézier Curves

Homework Discussion: What can you do with Bézier Curves?

Bernstein Basis Functions

Understanding the Properties of Bezier Curves

Drawing Bézier Curves:  de Casteljau Algorithm

Working with Bézier Curves

Stitching Bezier Curves Together

(more next time ...)

Preview of Lagrange Interpolation

New Reading Assignment:

Rockwood: pp 59-73 (Lagrange Interpolation)

New Homework Assignment: G1-Stitching of Bezier Curves

In this first programming assignment you will be introduced (gently) to SLIDE and to the Tcl language. Your actual programming will be less than ten lines of code (most of the expressions you will need have already been provided), but it encourages experimentation and thinking.

The goal is to learn how to stitch cubic Bezier segments together to make a smooth, pleasing-looking, interpolating curve that behaves well even for rather ragged control polygons with irregularly spaced control points (like the example we did in class by hand).

Your assignment is to find a robust expression for the placement for the inner control points of each Bezier segment, involving only information from the nearest neighbor points, and which guarantees a G1-continuous overall curve.

DUE: Sept. 12, 2006, 2:10pm. -- Hand in:

The code that you should modify and execute, can be found at:

Information on how to install SLIDE on your computer can be found at:

PREVIOUS < - - - - > CS 284 HOME < - - - - > CURRENT < - - - - > NEXT
Page Editor: Carlo H. Séquin