Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
3Activity
0 of .
Results for:
No results containing your search query
P. 1
Composite Cubic Bézier Surface with Cr Continuity

Composite Cubic Bézier Surface with Cr Continuity

Ratings: (0)|Views: 320|Likes:
Published by Sunway University
Written by Cheah Seong Leang

Published in Sunway University College Academic Journal Vol. 3
Written by Cheah Seong Leang

Published in Sunway University College Academic Journal Vol. 3

More info:

Categories:Types, Research, Science
Published by: Sunway University on Jan 14, 2010
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

10/31/2012

pdf

text

original

 
Sunway Academic Journal 3, 21–33 (2006)
COMPOSITE CUBIC BÉZIER SURFACEWITH C
r
CONTINUITY
CHEAH SEONG LEANG
a
 
Sunway University College
ABSTRACT
The Bézier surface with
r
C
continuity on each common boundary between two composite triangular Bézierpatches is generated. The directional derivatives on the Bernstein polynomials are discussed. This is to ensurethat the
r
C
continuity is maintained along the boundary between the piecewise polynomials. The compositepatches are then generated by elevating the degree of the Bézier triangles.Key words: Bézier triangle, directional derivatives,
r
C
continuity, de Casteljau’s algorithm.
INTRODUCTION
The idea of Bernstein polynomials on triangular patches was first introduced by de Casteljauin 1959 (Boehm et al., 1984). De Casteljau’s algorithm is commonly used for generating thegraph that approximates the bivariate Bernstein polynomials. It was proved by Mühlbach in1995 that the algorithm was indeed a particular case of the general extrapolation algorithmintroduced by Brezinski in 1980 (Brezinski, 1980; Carstensen et al., 1995).De Casteljau’s algorithm will partition the Bézier triangle into three subtriangles. Byrepeating the process, the triangular Bézier patch will converge to the triangular Béziersurface. By considering the
r
C
continuity at the common boundary between two triangularBézier patches, theorems and lemmas related to the directional derivatives on Bernsteinpolynomials are presented (Goldman, 1983). Based on the concept of 
r
C
continuity, theBézier surface with
1
C
or
2
C
continuity at the common boundary between two triangularBézier patches are demonstrated.
Bézier Function Surface of Degree n
 
on Triangular Domain
 Consider the trivariate Bernstein polynomials of degree n on a triangle as(1) n jik), j,(i,, w jviuk! j!i!n!)(nB
=++==
iui
 where
u
= (u,v,w) are the barycentric coordinates with u+v+w=1 and u,v,w
0. We can also
E-mail:
a
slcheah@academic.sunway.edu.my.This paper is an extension of an unpublished report (Cheah, 2000).
 
Cheah Seong Leang
22
obtain the recursive relation(2) )(1nwB)(1nvB)(1n1uB)(nB
uuuu i
++=
3ei2eiei
 where
1
e
= (1,0,0),
2
e
 
= (0,1,0) and
3
e
= (0,0,1) are index vectors. As the polynomials)(nB
ui
are linearly independent, they form the basis for the set
n
of polynomials of degree less than or equal to n on a triangle. Then a Bézier function surface of degree n onthe triangular domain}1wvu 0,wv,u,w)v,{(u,T
=++=
 is described as(3) n jik), j,(i,, nT,)( nBb)( np
=++== ==
i
iiuuiiu
 where
i
b
are the Bézier points
 
of 
)(np
u
. The points
i
b
will form the Bézier net or thetriangular Bézier patch of the triangular Bézier function surface
)(np
u
(Chen and Wang,2002). Sometimes the Bézier net and the function surface
)(np
u
are simply termed as Béziertriangle.Based on the relation (2), a recursive relation for generating triangular surfaces can beobtained as follows (Farin, 1981; 1982).
Theorem 1
Let }1wvu 0,wv,u,w)v,{(u,T
=++=
and the Bézier triangle of degree non the triangular domain T as
 jik), j,(i,,)( nBnb)(np
++== ==
iiuiiiu
 We define
iui
b)(0b
=
and for r = 1,2,…,n,(4) )(1rwb)(1rvb)(1rub)(rb
u3eiu2eiu1eiui
+++++=
, rn
=
i
 Then for r = 0,1,…,n,(5)
==
rn)(rn)B(br)(np
iuiuiu
 Specifically, when r = n,(6)
)(np
u
= )(nb
u0
 Since
)
(nb)(np
u0u
=
when r = n, then (4) and (6) give an algorithm to compute
)(np
u
.This algorithm is known as the de Casteljau’s algorithm for trivariate polynomials of degreen. Figure 1 shows the geometry behind de Casteljau’s algorithm. For any barycentriccoordinates (u,v,w), the points
)(np
u
are determined. The points
)(np
u
will subdivide thecontrol net of the Bézier triangle into three subtriangles.
 
Sunway Academic Journal 3, 21–33 (2006)
23
 
Theorem 2
If 
n0,1,...,r),(b
r
=
u
i
is defined as (4), then
 
(7) .rrn,)( rBb)( rb
==+=
iu
iui
 Figure 1. The formation of three subtriangles through de Casteljau’salgorithm. Bézier curves are generated at the common boundaries betweentwo adjacent patches.
DIRECTIONAL DERIVATIVES
Let
α
 
= (
α
1
,
α
2
,
α
3
)
 
+
x
+
x
+
and
x
= (x
1
, x
2
, x
3
) be the barycentric coordinates. Wedefine (Farin, 1981)(8)
321
3
2
1
,xxx D
321
α+α+α= =
.
 Consider
u
as the vector in the direction of two points with different barycentriccoordinates. Assume that
u
= (u
1
, u
2
, u
3
). Then u
1
+u
2
+u
3
= 0. Hence, the directionalderivatives of a function f in the direction of 
u
can be written as(9)
332211
xuxuxuD
++=
u
 As
21(0,1,0)11(1,0,0)
u)(B,u)(B
==
uu
and
31(0,0,1)
u)(B
=
u
, we can have(10)
=
=
11
)D(BD
   
u
u
 
Theorem 3
The directional derivative of order r for a function f in the direction of thevector
u
= (u
1
, u
2
,u
3
) , u
1
+ u
2
+ u
3
= 0, is given by(11)
ααα===
=
),,(,n,...,1,0r,)D(BD
321rrr
Â
   
u
u
+
x
+
x
+
 where D
0
f=f and
D
0
=
u
 

Activity (3)

You've already reviewed this. Edit your review.
1 thousand reads
1 hundred reads
magesh.mx liked this

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->