# cg17_2013 - Curves and Surfaces 2 Computer Graphics Lecture...

• Notes
• 64

This preview shows pages 1–18. Sign up to view the full content.

Curves and Surfaces 2 Computer Graphics Lecture 17 Taku Komura

This preview has intentionally blurred sections. Sign up to view the full version.

Today More about ('Bezier and ('Bsplines ■ de )(Casteljau’s algorithm BSpline : General form de Boor’s algorithm Knot insertion – NURBS Subdivision Surface
De Casteljau’s Algorithm • A method to evaluate (sample points in) or draw the Bezier curve • The Bezier curve of any degree can be handled • A precise way to evaluate the curves

This preview has intentionally blurred sections. Sign up to view the full version.

de Casteljau’s Algorithm
Why does this result in the polynomial?

This preview has intentionally blurred sections. Sign up to view the full version.

Why do we need this? • The explicit representation (monomial form) that I presented last week can result in some instability • Say the control points are randomly changed for 0.001. • The curve computed by the de Casteljau’s algorithm stays almost the same. • The curve by the polynomial basis form can deviate from the original curve if the degree is high
Connecting many Bezier Patches in the polynomial form • The same story applies to surfaces • The degree of surface can easily go high, as they are the multiplication of two curves • Bicubic → 6 • The error of 16 control points will be accumulated

This preview has intentionally blurred sections. Sign up to view the full version.

Today More about Bezier and Bsplines de Casteljau’s algorithm ■ ('BSpline % ,General form de Boor’s algorithm Knot insertion – NURBS Subdivision Surface
* &( ')splinJLe is FHa pFHarFHamJLetriHJc HJcurvJLe HJcomposJLeIKd oKMf FHa linJLeFHar HJcomGIbinFHation oKMf GIbFHasis ')°splinJLes > Q±VSW < L ± Q)²±ｫ±UR ° tOhJLe HJcontrol points 7TUZZZYY% ° suGIbIKdiviIKdJLe tOhJLe IKdomFHain oKMf tOhJLe ')° splinJLe HJcurvJLe into FHa sJLet oKMf knot spFHans @@Bt i ± t i²³ ´ 99;OhJLe ')°splinJLes HJcFHan GIbJLe IKdJLeKMfinJLeIKd GIby B-Spline : A General Form

This preview has intentionally blurred sections. Sign up to view the full version.

Bspline Basis
Bspline Basis (2)

This preview has intentionally blurred sections. Sign up to view the full version.

³µ¶³µ¶·µµ# 113JLeHJcturJLe 557roIKduHJcinNg (*(urvJLes GIby ')°88:plinJLes • 99;OhJLe GIbFHasis KMfunHJctions FHarJLe multipliJLeIKd to tOhJLe HJcontrol points FHanIKd to IKdJLeKMfinJLe FHarGIbitrFHary HJcurvJLes ¸ t m²³ µ
Knots • The knots produce a vector that defines the domain of the curve • The knots must be in the increasing order • But not necessarily uniform • If uniformly sampled and the degree is 3 uniform cubic bspline µ ³ · ¸ ¹ ! " # \$ ³µ ³³ ³· ³¸ knots

This preview has intentionally blurred sections. Sign up to view the full version.

Knots Here is an example of non-uniform knots