Scribd
Upload
29 views6 pages

Bezier 6P

The document discusses different techniques for generating spline curves: 1. Hermite spline interpolation uses control points and tangent vectors to define a cubic function between points. 2. Bezier curves approximate a curve using weighted control points and blending functions. A cubic Bezier curve is defined using 4 control points and binomial coefficients. 3. The Hermite and Bezier techniques are expressed using matrices to solve for the coefficients of polynomial functions defining the curves.

Uploaded by

Sharon kaur katyal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views6 pages

Bezier 6P

The document discusses different techniques for generating spline curves: 1. Hermite spline interpolation uses control points and tangent vectors to define a cubic function between points. 2. Bezier curves approximate a curve using weighted control points and blending functions. A cubic Bezier curve is defined using 4 control points and binomial coefficients. 3. The Hermite and Bezier techniques are expressed using matrices to solve for the coefficients of polynomial functions defining the curves.

Uploaded by

Sharon kaur katyal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

CURVE GENERATION

1. Curve
2. Spline Representation
3. Spline Curves
3.1 Control Points
3.2 Interpolation

3.3 Approximation
HERMITE SPLINE
(INTERPOLATION TECHNIQUE)

P(u) is parametric cubic function

P(u)=au3 + bu2 + cu + d , 0 <= u <= 1

Let P(u) be between control points PK and PK+1


P(0)= PK
P(1)= PK+1
P’(0)=D PK
P’(1)= DPK+1

Since P(u)=au3 + bu2 + cu + d------------------------------------------Eq.1

Then x component of P(u)


X(u)= axu3 + bxu2 + cxu + d

Then Y component of P(u)


Y(u)= ayu3 + byu2 + cyu + d

Then Z component of P(u)


Z(u)= aZu3 + bZu2 + cZu + d

Hence matrix equivalent of Eq.1


P(u)=[ u3 u2 u 1] a
b
c
d
P’(u)=3au2 +2 bu + c---------------------------------------Eq.2
a
P(u)=[ 3u2 2u 1 0] b
c
d
Put 0 in Eq. 1
P(0)= 0 + 0 + 0 + d------------------------------------------Eq.3

Put 1 in Eq. 1
P(1)= a + b + c + d------------------------------------------Eq.4

Put 0 in Eq. 2
P’(0)=0 + 0 + c + 0------------------------------------------Eq.5

Put 1 in Eq. 2
P’(1)= 3a + 2b + c + 0-------------------------------------Eq.6

Matrix based on Eq. 3 to Eq. 6

PK 0001 a
PK+1 1111 b
D PK = 0010 c
DPK+1 3210 d

-1
a 0001 PK
b 1111 PK+1
=
c 0010 D PK
d 3210 DPK+1

a 2 -2 1 1 PK
b -3 3 -2 -1 PK+1
=
c 0 0 1 0 D PK
d 1 0 0 0 DPK+1
a PK
b = PK+1
c
MH D PK
d DPK+1

PK
P(u)= [ u3 u2 u 1] MH PK+1
D PK
DPK+1

2 -2 1 1 PK
3 2
P(u)= [ u u u 1] -3 3 -2 -1 PK+1
0 0 1 0 D PK
1 0 0 0 DPK+1

PK
PK+1
P(u)=[2u3-3u2+1 -2u3-3u2 u3-2u2+4 u3-u2] D P
K
DPK+1

P(u)= PK(2u3-3u2+1) + PK+1(-2u3-3u2 ) + DPK(u3-2u2+4) + DPK+1 (u3-u2)

P(u)= PKH0(u) + PK+1 H1(u) + DPK H2(u) + DPK+1 H3(u)

H0(u) ,H1(u), H2(u), H3(u) are called BLENDING FUNCTIONS.


CUBIC BEZIER CURVE
(APPROXIMATION TECHNIQUE)
Suppose we are given n+1 control points positions: pk= (xk ,yk ,zk ) where k=0 to n
n

Position Vector P(u)=  Pk BEZk,n (u) , 0<=u<=1---------------Eq. 1


k=0

where BEZk,n (u) is Bezier Blending Function = C(n,k)uk(1-u)n-k


and C(n,k)= n!/(k! (n-k)!)

Expanding Eq. 1
P(u) = P0 BEZ0,n (u) + P1 BEZ1,n (u) + P2 BEZ2,n (u) + …… + Pn BEZn,n (u)

P(u) = P0 [C(n,0)u0(1-u)n-0 ] + P1 [C(n,1)u1(1-u)n-1 ] + P2 [C(n,2)u2(1-u)n-2 ] +


…… + Pn [C(n,n)un(1-u)n-n ]
Design an equation for Bezier Curve with degree 3.
Since degree is 3 then required control points are 4.
3

Position Vector P(u)=  Pk BEZk,3 (u) , 0<=u<=1---------------Eq. 1


k=0
Expanding Eq. 1
P(u)=P0 BEZ0,3 (u) + P1 BEZ1,3 (u) + P2 BEZ2,3 (u) + P3 BEZ3,3 (u)

BEZ0,3 (u)=C(3,0)u0(1-u)3-0 = 3!/(0! (3-0)!)[u0(1-u)3-0 ]= (1-u)3


BEZ1,3 (u)=C(3,1)u1(1-u)3-1 = 3!/(1! (3-1)!)[u1(1-u)3-1 ]= 3u(1-u)2
BEZ2,3 (u)=C(3,2)u2(1-u)3-2 = 3!/(2! (3-2)!)[u2(1-u)3-2 ]= 3u2(1-u)
BEZ3,3 (u)=C(3,3)u3(1-u)3-3 = 3!/(3! (3-3)!)[u3(1-u)3-3 ]= u3

P(u)=P0 [(1-u)3] + P1 [3u(1-u)2] + P2 [3u2(1-u) ] + P3 [u3 ]

P(u)=P0 [-u3+3u2-3u+1] + P1 [3u3-6u2+3u] + P2 [-3u3+3u2 ] + P3 [u3 ]

-1 3 -3 1
Bezier Matrix= 3 -6 3 0
-3 3 0 0
1 0 0 0

Hence -1 3 -3 1 P0
3 2
P(u)= [ u u u 1] 3 -6 3 0 P1
-3 3 0 0 P2
1 0 0 0 P3

You might also like