You are viewing the course site for a past offering of this course. The current offering may be found here.
Lecture 7: Geometry And Splines (64)
qqqube

I found this high-level description/pseudocode online which may help with understanding the steps a bit better (flatness referring to how close the control points are to the anchor points): If the curve is flat enough, draw a line segment between the starting point and endpoint; otherwise split the curve and draw each of the halves recursively.

raghav-cs184

Why is de casteljau's algorithm preferable to just using a set of basis functions and interpolating? What does thinking of bezier curves in this way help us do?

You must be enrolled in the course to comment