Bzier Curves

Professor, Dept. of Computer Science & Engineering Jahangirnagar University

Dr. Md. Al-Amin Bhuiyan

Bzier Curves
Bzier curve Q(t) of degree n: n
i =0

Q(t ) = Bi ,n (t )Pi , 0 t 1.

Bzier curves

where each term in the sum is the product of a blending function and a control point Pi. The are called Bernstein polynomials and are defined by

Bi , n ( t ) =
where
Ci
n

n i n i C i t (1 t ) .

is the binomial co-efficient given by:

n Ci

n! i! ( n i )

Properties of Bzier Curves

Movement of the control points influences the shape of the curve. The moving effect of control points is shown in Fig. The curves, as shown in Fig. 1 are predictably related to the locations of control points each seems to exert a pull on the portion of the curves near them. The control points also satisfy two important mathematical properties: the curves do pass through the two endpoints and are tangent at the endpoints to the corresponding edges of the polygons of the control points.

Bzier curves

Mathematical Expression

n i n i ( ) t 1 t Q(t ) = Pi i i =0
n
For n = 3 , Q (t )= 3 C 0 (1 t ) P0 + 3 C 1t (1 t ) P1 + 3 C 2 t 2 (1 t )P2 + 3 C 3 t 3 P3
3 2

(1t) tP (1t)t P =(1t) P 0 +3 1 +3 2 +t P 3

3 2 2 3

Mathematical Expression
3 i 3 i ( ) 1 Q(u ) = Pi t t i i =0
3 3 2 3 ( ) 3 1 t t P t P3 = (1 t ) P0 + 3t (1 t ) P + + 1 2 2

= t3

t2

= t3

t2

3 3 1 3 6 3 t 1 3 3 0 0 0 1 P0 P t 1 M Bezier 1 P2 P3

1 P0 P 0 1 0 P2 0 P3

Affine transformation:

P0 P0

x a b c x y = d e f y z g h i z

Error between the corresponding points:

i i E = Q(t = ) Q (t = ) N N i =0
N

P1 P1

= (Q Q )2 + (Q Q )2 ix ix iy iy
i =0

Euclidean distance between the control points:

)2 + ( P P )2 Ed = ( Pix Pix iy iy = ( P P )2 + ( P P )2 ix ix iy iy
i =0 i =0 2 3

P2

P
3

P3 P2

Computation of similarity between two curves

P0 P0 P1 P1

Euclidean distance between the control points:

)2 + ( P P )2 Ed = ( Pix Pix iy iy = ( P P )2 + ( P P )2 ix ix iy iy
i =0 i =0 2 3

Similarity between different curves:

S = Cd ,
d= 1 3

where ds (d=1,2,3) correspond to the compared portions. P3 P3 P2 Expressions Xk and Xe are said to be the same, if for all fi (i=1,..,n) dE fi ( X k ) fi ( Xe ) < Ei ,
d A fi ( X k ) fi ( Xe ) <Ai

P2

Computation of Similarity between Expressions