SlideShare a Scribd company logo
1 of 14
Download to read offline
International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013

INTERPOLATING RATIONAL BÉZIER SPLINE
CURVES WITH LOCAL SHAPE CONTROL
Alexander P. Pobegailo1
1

Department of Applied Mathematics and Computer Science, Belarusian State
University, Minsk, Belarus

ABSTRACT
The paper presents a technique for construction of Cn interpolating rational Bézier spline curves by means
of blending rational quadric Bézier curves. A class of polynomials which satisfy special boundary
conditions is used for blending. Properties of the polynomials are considered. The constructed spline
curves have local shape control that make them useful in such geometric applications as real-time
trajectory generation and fast curve sketching.

KEYWORDS
Blending Curves, Rational Bézier curves, Interpolation, Splines, Interpolating Rational Splines

1. INTRODUCTION
Interpolating spline curves play important role in different geometric applications. This paper
presents an approach to construction of interpolating rational Bézier spline curves with local
control which have Cn continuity. This property makes the spline curves suitable for using in
different real-time geometric applications concerned with trajectory generation. A shape of
the constructed spline curve can be modified by means of weights which are assigned to knot
points of the spline curve. This feature enables using of the presented spline curves for fast
sketching.
Segments of the presented spline curves are constructed by means of blending rational
quadric Bézier curves represented in homogeneous coordinates. The blending is performed by
means of special polynomials which are considered in the paper. The polynomials ensure a
necessary parametric continuity of the designed spline curves. The presented approach can be
considered as generalization of the approach to construction of interpolating spline curves in
linear spaces considered by the author [1].
Firstly construction of spline curves by linear blending of parabolic arcs was proposed by
Overhauser [2] and considered by Rogers and Adams [3]. Using linear blending of conics for
construction of spline curves was considered by Chuan Sun [4]. Polynomial blending which
ensures Gn continuity is considered in other articles of Hartmann [5] and Meek, Walton [6].
Some other works concerned with interpolation with rational spline curves can be mentioned.
Tai, Barsky and Loe presented an interpolation method that is based on blending a nonuniform
rational B-spline curve with a singularly reparameterized linear spline [7]. Interpolating rational
spline curves of cubic degree with shape control are considered in works [8-10]. Rational
cubic spline curves with G2 continuity is considered in the work [11]. Weighted rational cubic
spline interpolation and its application are considered in the articles [12-15].
DOI : 10.5121/ijcga.2013.3401

1
International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013

2. BLENDING POLYNOMIALS
The purpose of this section is to define polynomials which will be used for blending of parametric
curves. For this purpose consider the following knot sequences
(0,0, ,0,1,1, ,1)
   
  
n

n

and define the following polynomials:
wn (u ) =

2 n −1

∑b
i =n

2 n −1,i (u ) ,

u ∈ [0,1] ,

where bn ,m (u ) are Bernstein polynomials
bn ,m (u ) =

n!
(1 − u ) n − m u m .
m!( n − m)!

It follows from this definition that the polynomials wn(u) meet the following boundary conditions:
wn (0) = 0 , wn (1) = 1 ,

wn

(m)

( 0) = w n

(m)

(1) = 0 , ∀m ∈ {1,2, , n − 1} .

(2.1)
(2.2)

The polynomials wn(u) have the following properties:
wn (u ) + wn (1 − u ) = 1 ,
wn (1 / 2 + v) + wn (1 / 2 − v) = 1

(2.3)
(2.4)

which follow from the property
n

∑b

n , m (u )

=1

m =0

of Bernstein polynomials. It follows from Equation (2.4) that the polynomials wn(u) are
symmetric with respect to the point (1/2,1/2).
Besides it can be proven that
1/ 2

lim

n →∞

∫ w (u)du = 0
n

0

and that the polynomial wn(u) is a minimum of the functional
1

∫

J n ( f ) = | f ( n ) (u ) | 2 du , n ∈ N .
0

Proofs of the properties can be found in the paper [1]. Figure 1 shows graphs of the polynomials
wn(u).
The following polynomials of lower degrees:
w1 (u ) = u ,
w2 (u ) = 3(1 − u )u 2 + u 3 ,
w3 (u ) = 10(1 − u ) 2 u 3 + 5(1 − u )u 4 + u 5
2
International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013

are often used in geometric applications.

Figure 1. Graphs of the polynomials wn (u )

The polynomials wn(u) were introduced by the author [16, 17]. The representation of these
polynomials wn(u) by means of Bernstein polynomials was proposed by Wiltsche [18].

3. BLENDING CONIC ARCS
Consider two conic arcs pi(u), i∈{1, 2}, which are represented by means of rational Bézier
curves and have common boundary points that is
pi (u ) =

(1 − u ) 2 w0 p 0 + 2(1 − u )uwi ,1 pi ,1 + u 2 w2 p 2
(1 − u ) 2 w0 + 2(1 − u )uwi ,1 + u 2 w2

, u ∈ [0,1] .

(3.1)

The problem is to construct a parametric curve p(u) which has the following boundary points:
p(0) = p1 (0) = p 0 , p(1) = p 2 (1) = p 2
and satisfies the following boundary conditions:
(m)
(m)
p ( m ) (0) = p1 (0) , p ( m ) (1) = p 2 (1) , ∀m ∈ {1,2, , n} ,

(3.2)
(3.3)

where n∈N. The parametric curve p(u) which satisfies Equations (3.2) and (3.3) is called a
parametric curve blending the parametric curves p1(u) and p2(u).
In order to solve the problem represent the parametric curves pi(u), i∈{1, 2}, using
homogeneous coordinates as follows:
x i (u ) = (1 − u ) 2 x 0 + 2(1 − u )ux i ,1 + u 2 x 2 , u ∈ [0,1] ,
where the points x0, xi,1 and x2 have the corresponding weight coordinates w0, wi,1 and w2. Then
define the parametric curve x(u) as follows:
(3.4)
x (u ) = (1 − wn (u )) x1 (u ) + wn (u ) x 2 (u ) , u ∈ [0,1] ,
It follows from this definition that the corresponding parametric curve p(u) which is obtained
from the parametric curve x(u) by transition to Cartesian coordinates has the following
rational representation:
p(u ) =

(1 − wn (u ))r1 (u ) + wn (u )r2 (u )
, u ∈ [0,1] ,
(1 − wn (u ))r1 (u ) + wn (u )r2 (u )

(3.5)

where

3
International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013

ri (u ) = (1 − u ) 2 w0 p 0 + 2(1 − u )uwi ,1 pi ,1 + u 2 w2 p 2 , i ∈ {1,2} ,
ri (u ) = (1 − u ) 2 w0 + 2(1 − u )uwi ,1 + u 2 w2 , i ∈{1,2} .

It follows form the definition of the polynomials wn(u) that the parametric curve p(u) satisfies
conditions (3.2) because
p ( 0) =

(1 − wn (0))r1 (0) + wn (0) r2 (0) r1 (0)
=
= p1 (0) = p 0
(1 − wn (0))r1 (0) + wn (0) r2 (0) r1 (0)

p(1) =

(1 − wn (1))r1 (1) + wn (1) r2 (1) r2 (1)
=
= p 2 (1) = p 2 .
(1 − wn (1))r1 (0) + wn (1) r2 (1) r2 (1)

and

Derivatives of the parametric curve p(u) depend on derivatives of the numerator and
denominator of Equation (3.5). In order to simplify further considerations introduce the
following denotations:
r (u ) = (1 − wn (u ))r1 (u ) + wn (u ) r2 (u ) , u ∈ [0,1] ,
r (u ) = (1 − wn (u ))r1 (u ) + wn (u ) r2 (u ) , u ∈ [0,1] .

Now determine derivatives of the numerator r(u) and denominator r(u). It is obtained using
Leibnitz's formula that
r ( m ) (u ) =
r ( m ) (u ) =

m

∑ i!(m − i)! ((1 − w

n (u ))

(i )

r1

∑ i!(m − i)! ((1 − w

n (u ))

(i )

r1

i =0
m

m!

m!

( m −i )

(u ) + ( wn (u )) (i ) r2

( m −i )

( m −i )

(u ) + ( wn (u )) (i ) r2

( m −i )

(u ) ,
(u )

i =0

for any m∈N. Substitution of Equations (2.2) into these equations yields that the derivatives
have the following values at the boundaries of the interval [0,º1]:
r ( m ) (0) = (1 − wn (0))r1
r

(m)

(1) = (1 − wn (1))r1

(m)

(m)

(0) + wn (0)r2

(0) + wn (1)r2

(m)

(m)

(0) = r1

(1) = r2

(m)

(m)

( 0) ,

(1)

(3.6)
(3.7)

and analogously
r ( m ) (0) = (1 − wn (0))r1
r

(m)

(1) = (1 − wn (1))r1

(m)

(m)

(0) + wn (0)r2

(0) + wn (1)r2

(m)

(m)

(0) = r1

(1) = r2

(m)

(m)

( 0) ,

(1)

(3.8)
(3.9)

for any ∀m ∈{1,2, , n − 1} . Now show the derivatives of the order n also have necessary
values at the boundaries of the domain [0,º1]. It can be seen that
(
(
r ( n ) (0) = − wnn ) (0)r1 (0) + (1 − wn (0))r1( n ) (0) + wnn ) (0)r2 (0) + wn (0)r2( n ) (0) = r1( n ) (0)
(
(
r ( n ) (1) = − wnn ) (1)r1 (1) + (1 − wn (1))r1( n ) (1) + wnn ) (1)r2 (1) + wn (1)r2( n ) (1) = r2( n ) (1)

and analogously

4
International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013

r ( n ) (0) = r1( n ) (0) , r ( n ) (1) = r2( n ) (1) .

Thus it is proved that
r ( m ) (0) = r1

(m)

(0) = r1

(m)

r

(m)

(0) , r ( m ) (1) = r2
( 0) , r

(m)

(1) = r2

(m)

(1) ,

(m)

(1) , ∀m ∈{1,2, , n} .

Using obtained results compute higher order derivatives of the parametric curve p(u). It
follows form Equation (3.5) using introduced denotations for the numerator and denominator
that
r (u ) p(u ) = r (u ) , u ∈ [0,1] .
Differentiation of the last equation using Leibnitz's formula yields that
m
m!
r (i ) (u ) p ( m −i ) (u ) = r ( m ) (u ) , m ∈ N .
i = 0 i! ( m − i )!

∑

Substitution of Equations (3.6), (3.8) and (3.7), (3.9) into the last equation yields the
following values of derivatives at the boundaries of the interval [0,º1]:
m

∑ i!(m − i)! r
m!

(i )

(0) p ( m −i ) (0) = r1

(i )

(1) p ( m −i ) (1) = r2

1

i =0
m

∑ i!(m − i)! r
m!

2

(m)

( 0) ,

(3.10)

(m)

(1) .

(3.11)

i =0

On the other hand it follows from Equations (3.1) that
ri (u ) pi (u ) = ri (u ) , i ∈{1,2} ,

and therefore derivatives of the parametric curves pi(u), i∈{1, 2}, satisfy the following
equations:
m

∑ i!(m − i)! r
m!

(i )

(0) p1

(i )

(1) p 2

1

i =0
m

∑ i!(m − i)! r
m!

2

( m −i )

(0) = r1

(m)

( 0) ,

(3.12)

( m −i )

(1) = r2

(m)

(1) .

(3.13)

i =0

Show that Equations (3.10) and (3.12) are equivalent. Consider the first derivatives of the
parametric curves p(u) and p1(u). It follows from Equations (3.10) and (3.12) that the first
derivatives satisfy the following two equations:
r1 (0) p (1) (0) + r1 (0) p(0) = r1 (0) , r1 (0) p1 (0) + r1 (0) p1 (0) = r1 (0) .
It follows from these two equations taking into account Equations (3.2) that
(1)
p (1) (0) = p1 (0) .
(1)

(1)

(1)

(1)

(1)

Now assume that the following equation:

5
International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013

p ( m −1) (0) = p1

( m −1)

( 0)

is also fulfilled. Then consider the m-th order derivatives of the parametric curves p(u) and
p1(u). It follows from Equations (3.10) and (3.12) that the m-th order derivatives satisfy the
following equation:
m

∑ i!(m − i)! r
m!

(i )

1

( 0) p ( m − i ) ( 0) =

i =0

m

∑ i!(m − i)! r
m!

(i )

1

(0) p1

( m −i )

( 0)

i =0

which is equivalent to the equation
r1 (0) p ( m ) (0) +

m −1

( m − 1)!

∑ i!(m − 1 − i)! r

(i )

(0) p ( m −1−i ) (0) =

(i )

(0) p1

1

i =0

= r1 (0) p1

(m)

( 0) +

m −1

(m − 1)!

∑ i!(m − 1 − i)! r

1

( m −1− i )

( 0) .

i =0

It follows from the last equation taking into account the assumption that
p ( m ) (0) = p1

(m)

( 0) .

Therefore the last equation is fulfilled for all m∈N by the principle of mathematical
induction. Analogously it can be proven using Equations (3.11) and (3.13) that

p ( m ) (1) = p 2

(m)

(1) .

for all m∈N. Thus Equations (3.3) are also fulfilled.
Figure 2 shows some curves constructed by means of blending two conic arcs with the
polynomials wn(u).

Figure 2. Blending conic arcs by means of the polynomials wn(u)

4. BÉZIER REPRESENTATION OF BLENDED CONIC ARCS
The purpose of this section is to obtain a rational Bézier representation of the blending
parametric curve p(u) described by Equation (3.5). In order to solve the problem consider a
homogeneous representation x(u) of the parametric curve p(u) which is described by Equation
(3.6). Using Equation (2.3) the homogeneous representation can be transformed as follows:
x (u ) = (1 − wn (u )) x1 (u ) + wn (u ) x 2 (u ) =
= wn (1 − u ) x1 (u ) + wn (u ) x 2 (u ) =
6
International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013

=
=
+
=
+

=
+

n −1

∑b
k =0
n −1

∑b
k =0
2 n −1

2 n −1, k

(u )(b2,0 (u ) x 0 + b2,1 (u ) x1,1 + b2, 2 (u ) x 2 ) +

k =n
2 n −1

2 n −1, k

∑b

∑b

2 n −1, k

(u )b2,1 (u ) x 2,1 +

(u ) x 2 (u ) =

n −1

∑b
k =0
2 n −1

(u )c 0,k x 0 +

2 n −1, k

n

∑b

(u )c1,k x 2,1 +

2 n +1, k

2 n −1, k

∑b
k =0

2 n +1, k

∑b

2 n −1, k

(u )(b2,0 (u ) x 0 + b2,1 (u ) x 2,1 + b2, 2 (u ) x 2 ) =
(u )b2,0 (u ) x 0 +

∑b

k = n +1

k =n

2 n −1, k

k =0
2 n −1

k =0
2n

∑b

(u ) x1 (u ) +

∑b

k =n
2 n −1

2 n −1

2 n −1, k

k =1
2 n +1

2 n +1, k

∑b
k =2

2 n +1, k

(u )b2,1 (u ) x1,1 +
(u )b2, 2 (u ) x 2 =

(u )c1,k x1,1 +
(u )c 2,k x 2

Where
( 2n − k )(2n − k + 1)
, 0 ≤ k ≤ 2n − 1 ,
2n( 2n + 1)
k ( 2n − k + 1)
, 1 ≤ k ≤ 2n ,
=
n( 2n + 1)
( k − 1) k
, 2 ≤ k ≤ 2n + 1 .
=
2n( 2n + 1)

c 0, k =
c1,k
c 2, k

It follows from the last equations that the parametric curve x(u) has the following Bézier
representation:

x (u ) = b2 n +1,0 (u ) x 0 + b2 n +1,1 (u )(c0,1 x 0 + c1,1 x1,1 ) +
+

n

∑b
k =2

+

2 n +1, k

(u )(c 0,k x 0 + c1,k x1,1 + c 2,k x 2 ) +

2 n −1

∑b

k = n +1

2 n +1, k

(u )(c 0,k x 0 + c1,k x 2,1 + c 2,k x 2 ) +

+ b2 n +1, 2 n (u )(c1, 2 n x 2,1 + c 2, 2 n x 2 ) + b2 n +1, 2 n +1 (u ) x 2 .

Then transition to Cartesian coordinates yields that the blending parametric curve p(u) has the
following rational Bézier representation:
r (u )
, u ∈ [0,1] ,
(4.1)
p(u ) =
r (u )
where
r (u ) = b2 n +1,0 (u ) w0 p0 + b2 n +1,1 (u )(c0,1 w0 p0 + c1,1 w1,1 p1,1 ) +
+
+

n

∑b
k =2
2 n −1

2 n +1, k

∑b

k = n +1

(u )(c 0,k w0 p0 + c1,k w1,1 p1,1 + c 2,k w2 p 2 ) +

2 n +1, k

(u )(c 0,k w0 p0 + c1,k w2,1 p 2,1 + c 2,k w2, 2 p 2 ) +

7
International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013

+ b2 n +1, 2 n (u )(c1, 2 n w2,1 p 2,1 + c 2, 2 n w2 p 2 ) + b2 n +1, 2 n +1 (u ) w2 p 2

(4.2)

and
r (u ) = b2 n +1,0 (u ) w0 + b2 n +1,1 (u )(c 0,1 w0 + c1,1 w1,1 ) +
+
+

n

∑b
k =2
2 n −1

2 n +1, k

∑b

k = n +1

(u )(c 0,k w0 + c1,k w1,1 + c 2,k w2 ) +

2 n +1, k

(u )(c 0,k w0 + c1,k w2,1 + c 2,k w2, 2 ) +

+ b2 n +1, 2 n (u )(c1, 2 n w2,1 + c 2, 2 n w2 ) + b2 n +1, 2 n +1 (u ) w2

(4.3)

For example, the numerator and denominator of cubic and quintic blending parametric curves
have the following Bézier representations:
1
r (u ) = b3,0 (u ) w0 p0 + b3,1 (u ) ( w0 p0 + 2 w1,1 p1,1 ) +
3
1
+ b3, 2 (u ) ( 2 w2,1 p 2,1 + w2 p 2 ) + b3,3 (u ) w2 p 2 ,
3
1
1
r (u ) = b3,0 (u ) w0 + b3,1 (u ) ( w0 + 2 w1,1 ) + b3, 2 (u ) (2 w2,1 + w2 ) + b3,3 (u ) w2
3
3
and
1
r (u ) = b5,0 (u ) w0 p0 + b5,1 (u ) (3w0 p0 + 2w1,1 p1,1 ) +
5
1
1
+ b5, 2 (u ) (3w0 p0 + 6 w1,1 p1,1 + w2 p 2 ) + b5,3 (u ) ( w0 p0 + 6 w2,1 p 2,1 + 3w2 p 2 ) +
10
10
1
+ b5, 4 (u ) (2w2,1 p 2,1 + 3w2 p 2 ) + b5,5 (u ) w2 p 2 ,
5
1
r (u ) = b5,0 (u ) w0 + b5,1 (u ) (3w0 + 2 w1,1 ) +
5
1
1
+ b5, 2 (u ) (3w0 + 6w1,1 + w2 ) + b5,3 (u ) ( w0 + 6w2,1 + 3w2 ) +
10
10
1
+ b5, 4 (u ) (2 w2,1 + 3w2 ) + b5,5 (u ) w2
5
respectively.

5. CONSTRUCTION OF TWO SMOOTHLY JOINED CONIC ARCS
The purpose of this section is to introduce analytical expressions for construction smoothly joined
conic arcs. The expressions will be used for construction spline curves in the next section.
Consider three distinct points p0, p1, and p2 with the corresponding weights w0, w1 and w2. The
problem is to construct two conic arcs pi(u), i∈{1, 2}, which are represented by means of
rational Bézier curves
p1 (u ) =

p 2 (u ) =

(1 − u ) 2 w0 p0 + 2(1 − u )uw1,1 p1,1 + u 2 w1 p1
(1 − u ) 2 w0 + 2(1 − u )uw1,1 + u 2 w1

, u ∈ [0,1] ,

(1 − u ) 2 w1 p1 + 2(1 − u )uw2,1 p 2,1 + u 2 w2 p 2
(1 − u ) 2 w0 + 2(1 − u )uw2,1 + u 2 w2

, u ∈ [0,1]

(5.1)
(5.2)

and are smoothly joined at the common point p1 that is
8
International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013

p1

(n)

(1) = p 2

(n)

( 0) , n ∈ N .

(5.3)

In order to find control points p1,1, and p2,1 which ensure the necessary smooth junction represent
the conic arcs arcs p1(u) and p2(u) using homogeneous coordinates as follows
x1 (u ) = (1 − u ) 2 x 0 + 2(1 − u )ux1,1 + u 2 x1 , u ∈ [0,1] ,
x 2 (u ) = (1 − u ) 2 x1 + 2(1 − u )ux 2,1 + u 2 x 2 , u ∈ [0,1] .

The conic arcs arcs x1(u) and x2(u) are smoothly joined at the point x1 only provided that the
following two conditions:
′
′
x1 (1) = x ′ (0) , x1′(1) = x ′′ (0) .
2
2

(5.4)

are fulfilled. Resolution of these equations yields the following values of unknown control
points x1,1 and x2,2 of the quadric Bézier curves x1(u) and x2(u):
x − x0
x − x0
, x 2,1 = x1 + 2
.
x1,1 = x1 − 2
4
4
The values of knot points p1,1, and p2,1 can be obtained from these equations by transition to
transition to Cartesian coordinates as follows:

w2 p 2 − w0 p0
w p − w0 p0
, p 2,1 = w1 p1 + 2 2
.
4
4
w − w0
w − w0
, w2,1 = w1 + 2
.
w1,1 = w1 − 2
4
4
p1,1 = w1 p1 −

(5.5)
(5.6)

Show that in this case the conic arcs arcs p1(u) and p2(u) are also smoothly joined at the point p1.
For this purpose represent the conic arcs p1(u) and p2(u) as follows:
p i (u ) =

ri (u )
, i ∈ {1,2}
ri (u )

(5.7)

where
r1 (u ) = (1 − u ) 2 w0 p 0 + 2(1 − u )uw1,1 p1,1 + u 2 w1 p1 ,

r2 (u ) = (1 − u ) 2 w1 p1 + 2(1 − u )uw2,1 p 2,1 + u 2 w2 p 2

and
r1 (u ) = (1 − u ) 2 w0 + 2(1 − u )uw1,1 + u 2 w1 ,
r2 (u ) = (1 − u ) 2 w1 + 2(1 − u )uw2,1 + u 2 w2 .

It follows from Equations (5.4) that the first two derivatives of the numerators ri(u) and
denominators ri(u) satisfy the following conditions at the common point p1:
r1′(1) = r2′ (0) , r1′′(1) = r2′′(0)

and

(5.8)

r1′(1) = r2′ (0) , r1′′(1) = r2′′(0) .

(5.9)

It is obvious that any of all other higher order derivatives of the numerators ri(u) and
denominators ri(u) is equal to zero. Now transform Equation (5.7) as follows:
9
International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013

ri (u ) pi (u ) = ri (u ) , i ∈ {1,2} ,

and find the first derivatives of the equation parts. It is obtained that
ri′(u ) pi (u ) + ri (u ) pi′ (u ) = ri′(u ) , i ∈ {1,2} .

It follows from these equations taking into account Equations (5.8) and (5.9) that
r1′(1) − r1′(1) p1 (1) r2′ (0) − r2′ (0) p 2 (0)
=
= p ′ ( 0) .
2
r1 (1)
r2 (0)
Analogously it can be proven that
′
p1 (1) =

′
p1′(1) = p ′′ (0) .
2

Now notice that all higher order derivatives of the conic arcs pi(u) at the common point p1
depends only values of these parametric curves at the common point and the first two derivatives
of the numerators ri(u) and denominators ri(u) at the common point. Then taking into account
the last two equations it can be stated that Equations (5.3) are also fulfilled. Thus it is obtained
that the conic arcs p1(u) and p2(u) are smoothly joined at the common point p1.
Since spline curves will be constructed by means of blending conic arcs it is reasonable to
consider shape modification of the conic arc by means of changing weights of its knot points.
This modification behaves just opposite to the modification of a weight of the conic control point.
That is if a weight of the conic control point increases then the conic pulls toward the control
point. Otherwise if a weight of the conic control point decreases then the conic pushes away from
the control point. Figure 3 shows modification of a conic shape depending on a weight of its
control point. Values of the weight are depicted near the knot points.
On the other hand if a weight of the conic knot point increases then the conic pushes away from
the control point. Otherwise if a weight of the conic knot point decreases then the conic pulls
toward the control point. Figure 4 shows modification of a conic shape depending on a weight of
its knot point.
Now it is clear how weights of knot points influence on shape of two smoothly joined conics.
Figure 5 shows modification of two smoothly joined conic shape by means of the weight which is
prescribed to the knot point.

Figure 3. Modification of conic shape by means of a control point weight

10
International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013

Figure 4. Modification of conic shape by means of a knot point weight

Figure 5. Modification of two smoothly joined conic shape by means of weights

More detailed considerations concerned with modification of rational curve shape by means of
weights are presented in the works of Piegl [19], Sánchez-Reyes [20] and Juhász [21].

6. RATIONAL BÉZIER SPLINE CURVES WITH LOCAL SHAPE CONTROL
The purpose of this section is to present a technique for construction of a rational spline curve
p(u)∈Cn, n∈N, which interpolates a sequence of knot points pi, i∈{0, 1, 2,..., k}, k∈N, with the
corresponding weights wi. In order to solve the problem construct a segment pi(u), 0 < i < k, of the
parametric curve p(u) by means of blending two conic arcs pi,1(u) and pi,2(u) as was proposed in
Section 3. Figure 6 explains construction a segment pi(u) of the spline curve p(u).

Figure 6. Construction of a spline curve segment
11
International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013

In order to ensure Cn smoothness of the spline curve p(u) it is necessary to ensure that that the
conic arcs pi-1,1(u) and pi,2(u) are smoothly joined at the common point pi. This can be obtained by
constructing the conic arcs pi-1,1(u) and pi,2(u) as was proposed in Section 5. Taking into account
these considerations define the conic arcs pi,1(u) and pi,2(u) as follows:

pi ,1 (u ) =

(1 − u ) 2 wi pi + 2(1 − u )uwi ,1 pi ,1 + u 2 wi +1 pi +1
(1 − u ) 2 wi + 2(1 − u )uwi ,1 + u 2 wi +1

, u ∈ [0,1] .

for i∈{0, 1,..., k-1} and

pi , 2 (u ) =

(1 − u ) 2 wi pi + 2(1 − u )uwi , 2 pi , 2 + u 2 wi +1 pi +1
(1 − u ) 2 wi + 2(1 − u )uwi , 2 + u 2 wi +1

, u ∈ [0,1] .

for i∈{1, 2,..., k} where the control points pi,1 and pi,2 with the corresponding weights wi,1 and wi,2
are defined using Equations

wi +1 pi +1 − wi −1 pi −1
w p − wi −1 pi −1
, pi , 2 = wi pi + i +1 i +1
.
4
4
w − wi −1
w − wi −1
, wi , 2 = wi + i +1
.
wi ,1 = wi − i +1
4
4
pi ,1 = wi pi −

Then a segment pi(u) of the spline curve p(u) can be defined using Equation (3.5) as follows:

pi (u ) =

(1 − wn (u ))ri ,1 (u ) + wn (u )ri , 2 (u )
(1 − wn (u ))ri ,1 (u ) + wn (u )ri , 2 (u )

, u ∈ [0,1] ,

where

ri , j (u ) = (1 − u ) 2 wi pi + 2(1 − u )uwi , j pi , j + u 2 wi +1 pi +1 , j ∈ {1,2} ,
ri , j (u ) = (1 − u ) 2 wi + 2(1 − u )uwi , j + u 2 wi +1 , j ∈ {1,2} .
It follows from Equations (3.3) and (5.3) that in this case segments of the parametric curve p(u)
satisfy the following condition:

pi

(n)

(1) = pi +1 (0) , n ∈ N .
(n)

Figure 7 shows how a shape of the spline curve depends on the weight prescribed to the knot
point of the spline curve. Weights of all other knot points of the spline curve are equal to the
unity.

Figure 7. Modification of a spline curve shape by means of weights

12
International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013

7. CONCLUSIONS
The approach to construction of Cn continuous interpolating spline curves by means of blending
rational quadric Bézier curves is introduced. Spline curves are constructed locally which
implies local shape control of them by means of weights which are assigned to the knot
points of the constructed spline curve. Bézier representation of the considered spline curves is
introduced. The presented technique can be used for fast prototyping rational spline Bézier.
Besides since the spline curves are constructed locally the presented technique can be also
used in real-time geometric applications connected with computer graphics and animation.

REFERENCES
[1]

Pobegailo, A. P., Polynomial blending of parametric curves in linear spaces. BSU, Minsk, 2013.

[2]

Overhauser, A.W., (1968) “Analytic Definition of Curves and Surfaces by Parabolic Blending”, Tech.
Rep. No. SL68-40, Ford Motor Company Scientific Laboratory.

[3]

Rogers, D.F., Adams, J.A., (1989) Mathematical elements for computer graphics, McGraw-Hill
publisher.

[4]

Chuan Sun, Huanxi Zhao, (2009) “Generating fair, C2 continuous splines by blending conics”,
Computers & Graphics, Vol. 33, No. 2, pp. 173–180.

[5]

Hartmann, E., (2001) “Parametric Gn blending of curves and surfaces”, The Visual Computer, Vol. 17,
No. 1, pp. 1-13.

[6]

Meek, D.S., Walton, D. J., (2009) “Blending two parametric curves”, Computer-Aided Design, Vol.
41, No. 6, pp. 423-431.

[7]

Tai, C.-L., Barsky, B.A. and Loe, K.F., (2000) “An interpolation method with weights and relaxation
parameters”, in A. Cohen et al. (eds.), Curves and surface ftting, Saint-Malo, Vanderbilt Univ. Press,
Nashville, pp. 393-402.

[8]

Habib, Z., Sakai, M. and Sarfraz, M., (2004) “Interactive Shape Control with Rational Cubic Splines”,
Computer-Aided Design & Applications, Vol. 1, No. 1-4, pp. 709-718.

[9]

Habib, Z., Sarfraz, M. and Sakai, M., (2005) “Rational cubic spline interpolation with shape control”,
Computers & Graphics, Vol. 29, No. 4, pp. 594-605.

[10] Sarfraz, M., (1994) “Generalized geometric interpolation for rational cubic splines”, Computers &
Graphics, Vol. 18, No. 1, pp. 61–72.
[11] Karčiauskas, K., Peters, J., (2011) “Rational G2 splines”, Graphical Models, Vol. 73, No. 5, pp. 286–
295.
[12] Fangxun Bao, Qinghua Sun, Qi Duan, (2009) “Point control of the interpolating curve with a rational
cubic spline”, Journal of Visual Communication and Image Representation, Vol. 20, No. 4, pp. 275–
280.
[13] Qi Duan, Djidjeli, K., Price, W.G., Twizell, E.H., (2000) “Weighted rational cubic spline
interpolation and its application”, Journal of Computational and Applied Mathematics, Vol. 117, No.
2, pp. 121–135.
[14] Qi Duan, Fangxun Bao, Shitian Du, Twizell, E.H., (2009) “Local control of interpolating rational
cubic spline curves”, Computer-Aided Design, Vol. 41, No. 11, pp. 825–829.
[15] Qi Duana, Liqiu Wangb, Twizellc, E.H., (2005) “A new weighted rational cubic interpolation and its
approximation”, Applied Mathematics and Computation, Vol. 168, No. 2, pp. 990–1003.
[16] Pobegailo, A.P., (1991) “Local interpolation with weight functions for variable-smoothness curve
design”, Computer-Aided Design, Vol. 23, No. 8, pp. 579-582.
[17] Pobegailo, A.P., (1992) “Geometric modeling of curves using weighted linear and circular segments”,
The Visual Computer, Vol. 8, No. 4, pp. 241-245.
13
International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013
[18] Wiltsche, A., (2005) “Blending curves”, Journal for Geometry and Graphics, Vol. 9, No. 1, pp. 6775.
[19] Piegl, L., (1989) “Modifying the shape of rational B-splines. Part 1: curves”, Compuer.-Aided Design,
Vol. 21, No. 8, pp. 509-518.
[20] Sánchez-Reyes, J., (1997) “A Simple Technique for NURBS Shape Modification”, IEEE Computer
Graphics and Applications, Vol. 17, No. 1, pp. 52-59.
[21] Juhász, I., (1999) “Weight-based shape modification of NURBS curves”, Computer Aided Geometric
Design, Vol. 16, No. 5, pp. 377-383.
Authors
A. P. Pobegailo graduated from Belarusian State University in 1981. Then he
obtained Ph. Degree on system analysis and automatic control. Currently he is an
assistant professor at Belarusian State University. He teaches courses on operating
systems and systems design. His research interests include computer graphics and
geometric design.

14

More Related Content

What's hot

Matrix Product (Modulo-2) Of Cycle Graphs
Matrix Product (Modulo-2) Of Cycle GraphsMatrix Product (Modulo-2) Of Cycle Graphs
Matrix Product (Modulo-2) Of Cycle Graphsinventionjournals
 
Fixed point theorems for four mappings in fuzzy metric space using implicit r...
Fixed point theorems for four mappings in fuzzy metric space using implicit r...Fixed point theorems for four mappings in fuzzy metric space using implicit r...
Fixed point theorems for four mappings in fuzzy metric space using implicit r...Alexander Decker
 
M. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein Spaces
M. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein SpacesM. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein Spaces
M. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein SpacesSEENET-MTP
 
Fixed point result in probabilistic metric space
Fixed point result in probabilistic metric spaceFixed point result in probabilistic metric space
Fixed point result in probabilistic metric spaceAlexander Decker
 
Extension of Some Common Fixed Point Theorems using Compatible Mappings in Fu...
Extension of Some Common Fixed Point Theorems using Compatible Mappings in Fu...Extension of Some Common Fixed Point Theorems using Compatible Mappings in Fu...
Extension of Some Common Fixed Point Theorems using Compatible Mappings in Fu...IJRES Journal
 
A high accuracy approximation for half - space problems with anisotropic scat...
A high accuracy approximation for half - space problems with anisotropic scat...A high accuracy approximation for half - space problems with anisotropic scat...
A high accuracy approximation for half - space problems with anisotropic scat...IOSR Journals
 
B.tech ii unit-3 material multiple integration
B.tech ii unit-3 material multiple integrationB.tech ii unit-3 material multiple integration
B.tech ii unit-3 material multiple integrationRai University
 
A generalized bernoulli sub-ODE Method and Its applications for nonlinear evo...
A generalized bernoulli sub-ODE Method and Its applications for nonlinear evo...A generalized bernoulli sub-ODE Method and Its applications for nonlinear evo...
A generalized bernoulli sub-ODE Method and Its applications for nonlinear evo...inventy
 
Jones matrix formulation by the unitary matrix
Jones matrix formulation by the unitary matrixJones matrix formulation by the unitary matrix
Jones matrix formulation by the unitary matrixSachidanandChikkpeti
 
Numerical solution of linear volterra fredholm integro-
Numerical solution of linear volterra fredholm integro-Numerical solution of linear volterra fredholm integro-
Numerical solution of linear volterra fredholm integro-Alexander Decker
 
optimal solution method of integro-differential equaitions under laplace tran...
optimal solution method of integro-differential equaitions under laplace tran...optimal solution method of integro-differential equaitions under laplace tran...
optimal solution method of integro-differential equaitions under laplace tran...INFOGAIN PUBLICATION
 
METRIC DIMENSION AND UNCERTAINTY OF TRAVERSING ROBOTS IN A NETWORK
METRIC DIMENSION AND UNCERTAINTY OF TRAVERSING ROBOTS IN A NETWORKMETRIC DIMENSION AND UNCERTAINTY OF TRAVERSING ROBOTS IN A NETWORK
METRIC DIMENSION AND UNCERTAINTY OF TRAVERSING ROBOTS IN A NETWORKgraphhoc
 
Fieldtheoryhighlights2015 setb 16jan18
Fieldtheoryhighlights2015 setb 16jan18Fieldtheoryhighlights2015 setb 16jan18
Fieldtheoryhighlights2015 setb 16jan18foxtrot jp R
 
Generalized fixed point theorems for compatible mapping in fuzzy 2 metric spa...
Generalized fixed point theorems for compatible mapping in fuzzy 2 metric spa...Generalized fixed point theorems for compatible mapping in fuzzy 2 metric spa...
Generalized fixed point theorems for compatible mapping in fuzzy 2 metric spa...Alexander Decker
 

What's hot (20)

Matrix Product (Modulo-2) Of Cycle Graphs
Matrix Product (Modulo-2) Of Cycle GraphsMatrix Product (Modulo-2) Of Cycle Graphs
Matrix Product (Modulo-2) Of Cycle Graphs
 
Fixed point theorems for four mappings in fuzzy metric space using implicit r...
Fixed point theorems for four mappings in fuzzy metric space using implicit r...Fixed point theorems for four mappings in fuzzy metric space using implicit r...
Fixed point theorems for four mappings in fuzzy metric space using implicit r...
 
Matrices i
Matrices iMatrices i
Matrices i
 
M. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein Spaces
M. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein SpacesM. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein Spaces
M. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein Spaces
 
Fixed point result in probabilistic metric space
Fixed point result in probabilistic metric spaceFixed point result in probabilistic metric space
Fixed point result in probabilistic metric space
 
Extension of Some Common Fixed Point Theorems using Compatible Mappings in Fu...
Extension of Some Common Fixed Point Theorems using Compatible Mappings in Fu...Extension of Some Common Fixed Point Theorems using Compatible Mappings in Fu...
Extension of Some Common Fixed Point Theorems using Compatible Mappings in Fu...
 
A high accuracy approximation for half - space problems with anisotropic scat...
A high accuracy approximation for half - space problems with anisotropic scat...A high accuracy approximation for half - space problems with anisotropic scat...
A high accuracy approximation for half - space problems with anisotropic scat...
 
B.tech ii unit-3 material multiple integration
B.tech ii unit-3 material multiple integrationB.tech ii unit-3 material multiple integration
B.tech ii unit-3 material multiple integration
 
C142530
C142530C142530
C142530
 
A generalized bernoulli sub-ODE Method and Its applications for nonlinear evo...
A generalized bernoulli sub-ODE Method and Its applications for nonlinear evo...A generalized bernoulli sub-ODE Method and Its applications for nonlinear evo...
A generalized bernoulli sub-ODE Method and Its applications for nonlinear evo...
 
B.Tech-II_Unit-IV
B.Tech-II_Unit-IVB.Tech-II_Unit-IV
B.Tech-II_Unit-IV
 
Jones matrix formulation by the unitary matrix
Jones matrix formulation by the unitary matrixJones matrix formulation by the unitary matrix
Jones matrix formulation by the unitary matrix
 
Ijciet 10 02_085
Ijciet 10 02_085Ijciet 10 02_085
Ijciet 10 02_085
 
B.Tech-II_Unit-V
B.Tech-II_Unit-VB.Tech-II_Unit-V
B.Tech-II_Unit-V
 
Numerical solution of linear volterra fredholm integro-
Numerical solution of linear volterra fredholm integro-Numerical solution of linear volterra fredholm integro-
Numerical solution of linear volterra fredholm integro-
 
optimal solution method of integro-differential equaitions under laplace tran...
optimal solution method of integro-differential equaitions under laplace tran...optimal solution method of integro-differential equaitions under laplace tran...
optimal solution method of integro-differential equaitions under laplace tran...
 
METRIC DIMENSION AND UNCERTAINTY OF TRAVERSING ROBOTS IN A NETWORK
METRIC DIMENSION AND UNCERTAINTY OF TRAVERSING ROBOTS IN A NETWORKMETRIC DIMENSION AND UNCERTAINTY OF TRAVERSING ROBOTS IN A NETWORK
METRIC DIMENSION AND UNCERTAINTY OF TRAVERSING ROBOTS IN A NETWORK
 
Fieldtheoryhighlights2015 setb 16jan18
Fieldtheoryhighlights2015 setb 16jan18Fieldtheoryhighlights2015 setb 16jan18
Fieldtheoryhighlights2015 setb 16jan18
 
chapter2_alt
chapter2_altchapter2_alt
chapter2_alt
 
Generalized fixed point theorems for compatible mapping in fuzzy 2 metric spa...
Generalized fixed point theorems for compatible mapping in fuzzy 2 metric spa...Generalized fixed point theorems for compatible mapping in fuzzy 2 metric spa...
Generalized fixed point theorems for compatible mapping in fuzzy 2 metric spa...
 

Viewers also liked

Ventricular Assist Device
Ventricular Assist DeviceVentricular Assist Device
Ventricular Assist DeviceCelso Furukawa
 
データ活用のためのメタ情報を考慮した地理情報システム向けデータベースの提案
データ活用のためのメタ情報を考慮した地理情報システム向けデータベースの提案データ活用のためのメタ情報を考慮した地理情報システム向けデータベースの提案
データ活用のためのメタ情報を考慮した地理情報システム向けデータベースの提案okkunmobile
 
Cooperativa electrica
Cooperativa electricaCooperativa electrica
Cooperativa electricarolando2014
 
Order of operations
Order of operationsOrder of operations
Order of operationsKati W
 
e-mediación: Plataformas Web y mediación electrónica
e-mediación: Plataformas Web y mediación electrónicae-mediación: Plataformas Web y mediación electrónica
e-mediación: Plataformas Web y mediación electrónicamediacionuned
 
10 Ways to Annoy Every Connection on LinkedIn
10 Ways to Annoy Every Connection on LinkedIn10 Ways to Annoy Every Connection on LinkedIn
10 Ways to Annoy Every Connection on LinkedInFeoshia Davis
 
Ringkasan perkuliahan semester 3 mikrobiologi tanah dan bioteknologi pertania...
Ringkasan perkuliahan semester 3 mikrobiologi tanah dan bioteknologi pertania...Ringkasan perkuliahan semester 3 mikrobiologi tanah dan bioteknologi pertania...
Ringkasan perkuliahan semester 3 mikrobiologi tanah dan bioteknologi pertania...Bondan the Planter of Palm Oil
 
112 sol key faces
112 sol key faces112 sol key faces
112 sol key facesdgrivas
 
Artificial Heart & Applications of Ultrasound in Medicine
Artificial Heart & Applications of Ultrasound in MedicineArtificial Heart & Applications of Ultrasound in Medicine
Artificial Heart & Applications of Ultrasound in MedicineCelso Furukawa
 
Ringkasan perkuliahan semester 2 sosiologi pertanian (bagian 14)
Ringkasan perkuliahan semester 2 sosiologi pertanian (bagian 14)Ringkasan perkuliahan semester 2 sosiologi pertanian (bagian 14)
Ringkasan perkuliahan semester 2 sosiologi pertanian (bagian 14)Bondan the Planter of Palm Oil
 
La entrevista de Jesús con Nicodemo
La entrevista de Jesús con NicodemoLa entrevista de Jesús con Nicodemo
La entrevista de Jesús con NicodemoLuis Kun
 
Autolesiones causas psicologicas
Autolesiones   causas psicologicasAutolesiones   causas psicologicas
Autolesiones causas psicologicasMel Scheihing
 
Makalah cairan tubuh
Makalah cairan tubuhMakalah cairan tubuh
Makalah cairan tubuhdwimank
 

Viewers also liked (19)

MY PLN
MY PLNMY PLN
MY PLN
 
Ventricular Assist Device
Ventricular Assist DeviceVentricular Assist Device
Ventricular Assist Device
 
Guia insertar
Guia  insertarGuia  insertar
Guia insertar
 
データ活用のためのメタ情報を考慮した地理情報システム向けデータベースの提案
データ活用のためのメタ情報を考慮した地理情報システム向けデータベースの提案データ活用のためのメタ情報を考慮した地理情報システム向けデータベースの提案
データ活用のためのメタ情報を考慮した地理情報システム向けデータベースの提案
 
Koordinasi badan. cover
Koordinasi badan. coverKoordinasi badan. cover
Koordinasi badan. cover
 
Cooperativa electrica
Cooperativa electricaCooperativa electrica
Cooperativa electrica
 
Pauta juicios
Pauta juiciosPauta juicios
Pauta juicios
 
Order of operations
Order of operationsOrder of operations
Order of operations
 
e-mediación: Plataformas Web y mediación electrónica
e-mediación: Plataformas Web y mediación electrónicae-mediación: Plataformas Web y mediación electrónica
e-mediación: Plataformas Web y mediación electrónica
 
10 Ways to Annoy Every Connection on LinkedIn
10 Ways to Annoy Every Connection on LinkedIn10 Ways to Annoy Every Connection on LinkedIn
10 Ways to Annoy Every Connection on LinkedIn
 
Ringkasan perkuliahan semester 3 mikrobiologi tanah dan bioteknologi pertania...
Ringkasan perkuliahan semester 3 mikrobiologi tanah dan bioteknologi pertania...Ringkasan perkuliahan semester 3 mikrobiologi tanah dan bioteknologi pertania...
Ringkasan perkuliahan semester 3 mikrobiologi tanah dan bioteknologi pertania...
 
112 sol key faces
112 sol key faces112 sol key faces
112 sol key faces
 
Artificial Heart & Applications of Ultrasound in Medicine
Artificial Heart & Applications of Ultrasound in MedicineArtificial Heart & Applications of Ultrasound in Medicine
Artificial Heart & Applications of Ultrasound in Medicine
 
Sesion 2
Sesion 2Sesion 2
Sesion 2
 
Ringkasan perkuliahan semester 2 sosiologi pertanian (bagian 14)
Ringkasan perkuliahan semester 2 sosiologi pertanian (bagian 14)Ringkasan perkuliahan semester 2 sosiologi pertanian (bagian 14)
Ringkasan perkuliahan semester 2 sosiologi pertanian (bagian 14)
 
La entrevista de Jesús con Nicodemo
La entrevista de Jesús con NicodemoLa entrevista de Jesús con Nicodemo
La entrevista de Jesús con Nicodemo
 
Autolesiones causas psicologicas
Autolesiones   causas psicologicasAutolesiones   causas psicologicas
Autolesiones causas psicologicas
 
P.nª.2
P.nª.2P.nª.2
P.nª.2
 
Makalah cairan tubuh
Makalah cairan tubuhMakalah cairan tubuh
Makalah cairan tubuh
 

Similar to Interpolating rational bézier spline curves with local shape control

INTERPOLATING RATIONAL BÉZIER SPLINE CURVES WITH LOCAL SHAPE CONTROL
INTERPOLATING RATIONAL BÉZIER SPLINE CURVES WITH LOCAL SHAPE CONTROLINTERPOLATING RATIONAL BÉZIER SPLINE CURVES WITH LOCAL SHAPE CONTROL
INTERPOLATING RATIONAL BÉZIER SPLINE CURVES WITH LOCAL SHAPE CONTROLijcga
 
Notes on Equation of Plane
Notes on Equation of PlaneNotes on Equation of Plane
Notes on Equation of PlaneHerbert Mujungu
 
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...ieijjournal
 
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...ieijjournal
 
Fourier-transform analysis of a ridge waveguide and a rectangular coaxial line
Fourier-transform analysis of a ridge waveguide and a rectangular coaxial lineFourier-transform analysis of a ridge waveguide and a rectangular coaxial line
Fourier-transform analysis of a ridge waveguide and a rectangular coaxial lineYong Heui Cho
 
Fourier-transform analysis of a unilateral fin line and its derivatives
Fourier-transform analysis of a unilateral fin line and its derivativesFourier-transform analysis of a unilateral fin line and its derivatives
Fourier-transform analysis of a unilateral fin line and its derivativesYong Heui Cho
 
A0440109
A0440109A0440109
A0440109inventy
 
International Publication - (Calcolo)
International Publication - (Calcolo)International Publication - (Calcolo)
International Publication - (Calcolo)Alberto Auricchio
 
ABOUT MODELLING OF THE GRAVITATIONAL FIELDS
ABOUT MODELLING OF THE GRAVITATIONAL FIELDSABOUT MODELLING OF THE GRAVITATIONAL FIELDS
ABOUT MODELLING OF THE GRAVITATIONAL FIELDSijrap
 
Some new exact Solutions for the nonlinear schrödinger equation
Some new exact Solutions for the nonlinear schrödinger equationSome new exact Solutions for the nonlinear schrödinger equation
Some new exact Solutions for the nonlinear schrödinger equationinventy
 
Notions of equivalence for linear multivariable systems
Notions of equivalence for linear multivariable systemsNotions of equivalence for linear multivariable systems
Notions of equivalence for linear multivariable systemsStavros Vologiannidis
 
FURTHER RESULTS ON ODD HARMONIOUS GRAPHS
FURTHER RESULTS ON ODD HARMONIOUS GRAPHSFURTHER RESULTS ON ODD HARMONIOUS GRAPHS
FURTHER RESULTS ON ODD HARMONIOUS GRAPHSFransiskeran
 
FURTHER RESULTS ON ODD HARMONIOUS GRAPHS
FURTHER RESULTS ON ODD HARMONIOUS GRAPHSFURTHER RESULTS ON ODD HARMONIOUS GRAPHS
FURTHER RESULTS ON ODD HARMONIOUS GRAPHSgraphhoc
 
Innerproductspaces 151013072051-lva1-app6892 (1)
Innerproductspaces 151013072051-lva1-app6892 (1)Innerproductspaces 151013072051-lva1-app6892 (1)
Innerproductspaces 151013072051-lva1-app6892 (1)Himanshi Upadhyay
 
The Geometric Characteristics of the Linear Features in Close Range Photogram...
The Geometric Characteristics of the Linear Features in Close Range Photogram...The Geometric Characteristics of the Linear Features in Close Range Photogram...
The Geometric Characteristics of the Linear Features in Close Range Photogram...IJERD Editor
 

Similar to Interpolating rational bézier spline curves with local shape control (20)

INTERPOLATING RATIONAL BÉZIER SPLINE CURVES WITH LOCAL SHAPE CONTROL
INTERPOLATING RATIONAL BÉZIER SPLINE CURVES WITH LOCAL SHAPE CONTROLINTERPOLATING RATIONAL BÉZIER SPLINE CURVES WITH LOCAL SHAPE CONTROL
INTERPOLATING RATIONAL BÉZIER SPLINE CURVES WITH LOCAL SHAPE CONTROL
 
Notes on Equation of Plane
Notes on Equation of PlaneNotes on Equation of Plane
Notes on Equation of Plane
 
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
 
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
 
Curve modeling
Curve modelingCurve modeling
Curve modeling
 
Fourier-transform analysis of a ridge waveguide and a rectangular coaxial line
Fourier-transform analysis of a ridge waveguide and a rectangular coaxial lineFourier-transform analysis of a ridge waveguide and a rectangular coaxial line
Fourier-transform analysis of a ridge waveguide and a rectangular coaxial line
 
Fourier-transform analysis of a unilateral fin line and its derivatives
Fourier-transform analysis of a unilateral fin line and its derivativesFourier-transform analysis of a unilateral fin line and its derivatives
Fourier-transform analysis of a unilateral fin line and its derivatives
 
A0440109
A0440109A0440109
A0440109
 
International Publication - (Calcolo)
International Publication - (Calcolo)International Publication - (Calcolo)
International Publication - (Calcolo)
 
ABOUT MODELLING OF THE GRAVITATIONAL FIELDS
ABOUT MODELLING OF THE GRAVITATIONAL FIELDSABOUT MODELLING OF THE GRAVITATIONAL FIELDS
ABOUT MODELLING OF THE GRAVITATIONAL FIELDS
 
Some new exact Solutions for the nonlinear schrödinger equation
Some new exact Solutions for the nonlinear schrödinger equationSome new exact Solutions for the nonlinear schrödinger equation
Some new exact Solutions for the nonlinear schrödinger equation
 
Ijetcas14 567
Ijetcas14 567Ijetcas14 567
Ijetcas14 567
 
farrell1966.pdf
farrell1966.pdffarrell1966.pdf
farrell1966.pdf
 
NODDEA2012_VANKOVA
NODDEA2012_VANKOVANODDEA2012_VANKOVA
NODDEA2012_VANKOVA
 
Notions of equivalence for linear multivariable systems
Notions of equivalence for linear multivariable systemsNotions of equivalence for linear multivariable systems
Notions of equivalence for linear multivariable systems
 
FURTHER RESULTS ON ODD HARMONIOUS GRAPHS
FURTHER RESULTS ON ODD HARMONIOUS GRAPHSFURTHER RESULTS ON ODD HARMONIOUS GRAPHS
FURTHER RESULTS ON ODD HARMONIOUS GRAPHS
 
FURTHER RESULTS ON ODD HARMONIOUS GRAPHS
FURTHER RESULTS ON ODD HARMONIOUS GRAPHSFURTHER RESULTS ON ODD HARMONIOUS GRAPHS
FURTHER RESULTS ON ODD HARMONIOUS GRAPHS
 
Innerproductspaces 151013072051-lva1-app6892 (1)
Innerproductspaces 151013072051-lva1-app6892 (1)Innerproductspaces 151013072051-lva1-app6892 (1)
Innerproductspaces 151013072051-lva1-app6892 (1)
 
Dr. majeed &humam paper
Dr. majeed &humam paperDr. majeed &humam paper
Dr. majeed &humam paper
 
The Geometric Characteristics of the Linear Features in Close Range Photogram...
The Geometric Characteristics of the Linear Features in Close Range Photogram...The Geometric Characteristics of the Linear Features in Close Range Photogram...
The Geometric Characteristics of the Linear Features in Close Range Photogram...
 

Recently uploaded

How to convert PDF to text with Nanonets
How to convert PDF to text with NanonetsHow to convert PDF to text with Nanonets
How to convert PDF to text with Nanonetsnaman860154
 
Breaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path MountBreaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path MountPuma Security, LLC
 
Handwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsHandwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsMaria Levchenko
 
Scaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organizationScaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organizationRadu Cotescu
 
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...gurkirankumar98700
 
Boost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivityBoost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivityPrincipled Technologies
 
[2024]Digital Global Overview Report 2024 Meltwater.pdf
[2024]Digital Global Overview Report 2024 Meltwater.pdf[2024]Digital Global Overview Report 2024 Meltwater.pdf
[2024]Digital Global Overview Report 2024 Meltwater.pdfhans926745
 
Google AI Hackathon: LLM based Evaluator for RAG
Google AI Hackathon: LLM based Evaluator for RAGGoogle AI Hackathon: LLM based Evaluator for RAG
Google AI Hackathon: LLM based Evaluator for RAGSujit Pal
 
The 7 Things I Know About Cyber Security After 25 Years | April 2024
The 7 Things I Know About Cyber Security After 25 Years | April 2024The 7 Things I Know About Cyber Security After 25 Years | April 2024
The 7 Things I Know About Cyber Security After 25 Years | April 2024Rafal Los
 
Maximizing Board Effectiveness 2024 Webinar.pptx
Maximizing Board Effectiveness 2024 Webinar.pptxMaximizing Board Effectiveness 2024 Webinar.pptx
Maximizing Board Effectiveness 2024 Webinar.pptxOnBoard
 
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationFrom Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationSafe Software
 
A Call to Action for Generative AI in 2024
A Call to Action for Generative AI in 2024A Call to Action for Generative AI in 2024
A Call to Action for Generative AI in 2024Results
 
The Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptxThe Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptxMalak Abu Hammad
 
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...Igalia
 
Presentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreterPresentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreternaman860154
 
My Hashitalk Indonesia April 2024 Presentation
My Hashitalk Indonesia April 2024 PresentationMy Hashitalk Indonesia April 2024 Presentation
My Hashitalk Indonesia April 2024 PresentationRidwan Fadjar
 
SQL Database Design For Developers at php[tek] 2024
SQL Database Design For Developers at php[tek] 2024SQL Database Design For Developers at php[tek] 2024
SQL Database Design For Developers at php[tek] 2024Scott Keck-Warren
 
CNv6 Instructor Chapter 6 Quality of Service
CNv6 Instructor Chapter 6 Quality of ServiceCNv6 Instructor Chapter 6 Quality of Service
CNv6 Instructor Chapter 6 Quality of Servicegiselly40
 
IAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI SolutionsIAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI SolutionsEnterprise Knowledge
 
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking MenDelhi Call girls
 

Recently uploaded (20)

How to convert PDF to text with Nanonets
How to convert PDF to text with NanonetsHow to convert PDF to text with Nanonets
How to convert PDF to text with Nanonets
 
Breaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path MountBreaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path Mount
 
Handwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsHandwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed texts
 
Scaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organizationScaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organization
 
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...
 
Boost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivityBoost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivity
 
[2024]Digital Global Overview Report 2024 Meltwater.pdf
[2024]Digital Global Overview Report 2024 Meltwater.pdf[2024]Digital Global Overview Report 2024 Meltwater.pdf
[2024]Digital Global Overview Report 2024 Meltwater.pdf
 
Google AI Hackathon: LLM based Evaluator for RAG
Google AI Hackathon: LLM based Evaluator for RAGGoogle AI Hackathon: LLM based Evaluator for RAG
Google AI Hackathon: LLM based Evaluator for RAG
 
The 7 Things I Know About Cyber Security After 25 Years | April 2024
The 7 Things I Know About Cyber Security After 25 Years | April 2024The 7 Things I Know About Cyber Security After 25 Years | April 2024
The 7 Things I Know About Cyber Security After 25 Years | April 2024
 
Maximizing Board Effectiveness 2024 Webinar.pptx
Maximizing Board Effectiveness 2024 Webinar.pptxMaximizing Board Effectiveness 2024 Webinar.pptx
Maximizing Board Effectiveness 2024 Webinar.pptx
 
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationFrom Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
 
A Call to Action for Generative AI in 2024
A Call to Action for Generative AI in 2024A Call to Action for Generative AI in 2024
A Call to Action for Generative AI in 2024
 
The Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptxThe Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptx
 
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...
 
Presentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreterPresentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreter
 
My Hashitalk Indonesia April 2024 Presentation
My Hashitalk Indonesia April 2024 PresentationMy Hashitalk Indonesia April 2024 Presentation
My Hashitalk Indonesia April 2024 Presentation
 
SQL Database Design For Developers at php[tek] 2024
SQL Database Design For Developers at php[tek] 2024SQL Database Design For Developers at php[tek] 2024
SQL Database Design For Developers at php[tek] 2024
 
CNv6 Instructor Chapter 6 Quality of Service
CNv6 Instructor Chapter 6 Quality of ServiceCNv6 Instructor Chapter 6 Quality of Service
CNv6 Instructor Chapter 6 Quality of Service
 
IAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI SolutionsIAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI Solutions
 
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
 

Interpolating rational bézier spline curves with local shape control

  • 1. International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013 INTERPOLATING RATIONAL BÉZIER SPLINE CURVES WITH LOCAL SHAPE CONTROL Alexander P. Pobegailo1 1 Department of Applied Mathematics and Computer Science, Belarusian State University, Minsk, Belarus ABSTRACT The paper presents a technique for construction of Cn interpolating rational Bézier spline curves by means of blending rational quadric Bézier curves. A class of polynomials which satisfy special boundary conditions is used for blending. Properties of the polynomials are considered. The constructed spline curves have local shape control that make them useful in such geometric applications as real-time trajectory generation and fast curve sketching. KEYWORDS Blending Curves, Rational Bézier curves, Interpolation, Splines, Interpolating Rational Splines 1. INTRODUCTION Interpolating spline curves play important role in different geometric applications. This paper presents an approach to construction of interpolating rational Bézier spline curves with local control which have Cn continuity. This property makes the spline curves suitable for using in different real-time geometric applications concerned with trajectory generation. A shape of the constructed spline curve can be modified by means of weights which are assigned to knot points of the spline curve. This feature enables using of the presented spline curves for fast sketching. Segments of the presented spline curves are constructed by means of blending rational quadric Bézier curves represented in homogeneous coordinates. The blending is performed by means of special polynomials which are considered in the paper. The polynomials ensure a necessary parametric continuity of the designed spline curves. The presented approach can be considered as generalization of the approach to construction of interpolating spline curves in linear spaces considered by the author [1]. Firstly construction of spline curves by linear blending of parabolic arcs was proposed by Overhauser [2] and considered by Rogers and Adams [3]. Using linear blending of conics for construction of spline curves was considered by Chuan Sun [4]. Polynomial blending which ensures Gn continuity is considered in other articles of Hartmann [5] and Meek, Walton [6]. Some other works concerned with interpolation with rational spline curves can be mentioned. Tai, Barsky and Loe presented an interpolation method that is based on blending a nonuniform rational B-spline curve with a singularly reparameterized linear spline [7]. Interpolating rational spline curves of cubic degree with shape control are considered in works [8-10]. Rational cubic spline curves with G2 continuity is considered in the work [11]. Weighted rational cubic spline interpolation and its application are considered in the articles [12-15]. DOI : 10.5121/ijcga.2013.3401 1
  • 2. International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013 2. BLENDING POLYNOMIALS The purpose of this section is to define polynomials which will be used for blending of parametric curves. For this purpose consider the following knot sequences (0,0, ,0,1,1, ,1)        n n and define the following polynomials: wn (u ) = 2 n −1 ∑b i =n 2 n −1,i (u ) , u ∈ [0,1] , where bn ,m (u ) are Bernstein polynomials bn ,m (u ) = n! (1 − u ) n − m u m . m!( n − m)! It follows from this definition that the polynomials wn(u) meet the following boundary conditions: wn (0) = 0 , wn (1) = 1 , wn (m) ( 0) = w n (m) (1) = 0 , ∀m ∈ {1,2, , n − 1} . (2.1) (2.2) The polynomials wn(u) have the following properties: wn (u ) + wn (1 − u ) = 1 , wn (1 / 2 + v) + wn (1 / 2 − v) = 1 (2.3) (2.4) which follow from the property n ∑b n , m (u ) =1 m =0 of Bernstein polynomials. It follows from Equation (2.4) that the polynomials wn(u) are symmetric with respect to the point (1/2,1/2). Besides it can be proven that 1/ 2 lim n →∞ ∫ w (u)du = 0 n 0 and that the polynomial wn(u) is a minimum of the functional 1 ∫ J n ( f ) = | f ( n ) (u ) | 2 du , n ∈ N . 0 Proofs of the properties can be found in the paper [1]. Figure 1 shows graphs of the polynomials wn(u). The following polynomials of lower degrees: w1 (u ) = u , w2 (u ) = 3(1 − u )u 2 + u 3 , w3 (u ) = 10(1 − u ) 2 u 3 + 5(1 − u )u 4 + u 5 2
  • 3. International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013 are often used in geometric applications. Figure 1. Graphs of the polynomials wn (u ) The polynomials wn(u) were introduced by the author [16, 17]. The representation of these polynomials wn(u) by means of Bernstein polynomials was proposed by Wiltsche [18]. 3. BLENDING CONIC ARCS Consider two conic arcs pi(u), i∈{1, 2}, which are represented by means of rational Bézier curves and have common boundary points that is pi (u ) = (1 − u ) 2 w0 p 0 + 2(1 − u )uwi ,1 pi ,1 + u 2 w2 p 2 (1 − u ) 2 w0 + 2(1 − u )uwi ,1 + u 2 w2 , u ∈ [0,1] . (3.1) The problem is to construct a parametric curve p(u) which has the following boundary points: p(0) = p1 (0) = p 0 , p(1) = p 2 (1) = p 2 and satisfies the following boundary conditions: (m) (m) p ( m ) (0) = p1 (0) , p ( m ) (1) = p 2 (1) , ∀m ∈ {1,2, , n} , (3.2) (3.3) where n∈N. The parametric curve p(u) which satisfies Equations (3.2) and (3.3) is called a parametric curve blending the parametric curves p1(u) and p2(u). In order to solve the problem represent the parametric curves pi(u), i∈{1, 2}, using homogeneous coordinates as follows: x i (u ) = (1 − u ) 2 x 0 + 2(1 − u )ux i ,1 + u 2 x 2 , u ∈ [0,1] , where the points x0, xi,1 and x2 have the corresponding weight coordinates w0, wi,1 and w2. Then define the parametric curve x(u) as follows: (3.4) x (u ) = (1 − wn (u )) x1 (u ) + wn (u ) x 2 (u ) , u ∈ [0,1] , It follows from this definition that the corresponding parametric curve p(u) which is obtained from the parametric curve x(u) by transition to Cartesian coordinates has the following rational representation: p(u ) = (1 − wn (u ))r1 (u ) + wn (u )r2 (u ) , u ∈ [0,1] , (1 − wn (u ))r1 (u ) + wn (u )r2 (u ) (3.5) where 3
  • 4. International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013 ri (u ) = (1 − u ) 2 w0 p 0 + 2(1 − u )uwi ,1 pi ,1 + u 2 w2 p 2 , i ∈ {1,2} , ri (u ) = (1 − u ) 2 w0 + 2(1 − u )uwi ,1 + u 2 w2 , i ∈{1,2} . It follows form the definition of the polynomials wn(u) that the parametric curve p(u) satisfies conditions (3.2) because p ( 0) = (1 − wn (0))r1 (0) + wn (0) r2 (0) r1 (0) = = p1 (0) = p 0 (1 − wn (0))r1 (0) + wn (0) r2 (0) r1 (0) p(1) = (1 − wn (1))r1 (1) + wn (1) r2 (1) r2 (1) = = p 2 (1) = p 2 . (1 − wn (1))r1 (0) + wn (1) r2 (1) r2 (1) and Derivatives of the parametric curve p(u) depend on derivatives of the numerator and denominator of Equation (3.5). In order to simplify further considerations introduce the following denotations: r (u ) = (1 − wn (u ))r1 (u ) + wn (u ) r2 (u ) , u ∈ [0,1] , r (u ) = (1 − wn (u ))r1 (u ) + wn (u ) r2 (u ) , u ∈ [0,1] . Now determine derivatives of the numerator r(u) and denominator r(u). It is obtained using Leibnitz's formula that r ( m ) (u ) = r ( m ) (u ) = m ∑ i!(m − i)! ((1 − w n (u )) (i ) r1 ∑ i!(m − i)! ((1 − w n (u )) (i ) r1 i =0 m m! m! ( m −i ) (u ) + ( wn (u )) (i ) r2 ( m −i ) ( m −i ) (u ) + ( wn (u )) (i ) r2 ( m −i ) (u ) , (u ) i =0 for any m∈N. Substitution of Equations (2.2) into these equations yields that the derivatives have the following values at the boundaries of the interval [0,º1]: r ( m ) (0) = (1 − wn (0))r1 r (m) (1) = (1 − wn (1))r1 (m) (m) (0) + wn (0)r2 (0) + wn (1)r2 (m) (m) (0) = r1 (1) = r2 (m) (m) ( 0) , (1) (3.6) (3.7) and analogously r ( m ) (0) = (1 − wn (0))r1 r (m) (1) = (1 − wn (1))r1 (m) (m) (0) + wn (0)r2 (0) + wn (1)r2 (m) (m) (0) = r1 (1) = r2 (m) (m) ( 0) , (1) (3.8) (3.9) for any ∀m ∈{1,2, , n − 1} . Now show the derivatives of the order n also have necessary values at the boundaries of the domain [0,º1]. It can be seen that ( ( r ( n ) (0) = − wnn ) (0)r1 (0) + (1 − wn (0))r1( n ) (0) + wnn ) (0)r2 (0) + wn (0)r2( n ) (0) = r1( n ) (0) ( ( r ( n ) (1) = − wnn ) (1)r1 (1) + (1 − wn (1))r1( n ) (1) + wnn ) (1)r2 (1) + wn (1)r2( n ) (1) = r2( n ) (1) and analogously 4
  • 5. International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013 r ( n ) (0) = r1( n ) (0) , r ( n ) (1) = r2( n ) (1) . Thus it is proved that r ( m ) (0) = r1 (m) (0) = r1 (m) r (m) (0) , r ( m ) (1) = r2 ( 0) , r (m) (1) = r2 (m) (1) , (m) (1) , ∀m ∈{1,2, , n} . Using obtained results compute higher order derivatives of the parametric curve p(u). It follows form Equation (3.5) using introduced denotations for the numerator and denominator that r (u ) p(u ) = r (u ) , u ∈ [0,1] . Differentiation of the last equation using Leibnitz's formula yields that m m! r (i ) (u ) p ( m −i ) (u ) = r ( m ) (u ) , m ∈ N . i = 0 i! ( m − i )! ∑ Substitution of Equations (3.6), (3.8) and (3.7), (3.9) into the last equation yields the following values of derivatives at the boundaries of the interval [0,º1]: m ∑ i!(m − i)! r m! (i ) (0) p ( m −i ) (0) = r1 (i ) (1) p ( m −i ) (1) = r2 1 i =0 m ∑ i!(m − i)! r m! 2 (m) ( 0) , (3.10) (m) (1) . (3.11) i =0 On the other hand it follows from Equations (3.1) that ri (u ) pi (u ) = ri (u ) , i ∈{1,2} , and therefore derivatives of the parametric curves pi(u), i∈{1, 2}, satisfy the following equations: m ∑ i!(m − i)! r m! (i ) (0) p1 (i ) (1) p 2 1 i =0 m ∑ i!(m − i)! r m! 2 ( m −i ) (0) = r1 (m) ( 0) , (3.12) ( m −i ) (1) = r2 (m) (1) . (3.13) i =0 Show that Equations (3.10) and (3.12) are equivalent. Consider the first derivatives of the parametric curves p(u) and p1(u). It follows from Equations (3.10) and (3.12) that the first derivatives satisfy the following two equations: r1 (0) p (1) (0) + r1 (0) p(0) = r1 (0) , r1 (0) p1 (0) + r1 (0) p1 (0) = r1 (0) . It follows from these two equations taking into account Equations (3.2) that (1) p (1) (0) = p1 (0) . (1) (1) (1) (1) (1) Now assume that the following equation: 5
  • 6. International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013 p ( m −1) (0) = p1 ( m −1) ( 0) is also fulfilled. Then consider the m-th order derivatives of the parametric curves p(u) and p1(u). It follows from Equations (3.10) and (3.12) that the m-th order derivatives satisfy the following equation: m ∑ i!(m − i)! r m! (i ) 1 ( 0) p ( m − i ) ( 0) = i =0 m ∑ i!(m − i)! r m! (i ) 1 (0) p1 ( m −i ) ( 0) i =0 which is equivalent to the equation r1 (0) p ( m ) (0) + m −1 ( m − 1)! ∑ i!(m − 1 − i)! r (i ) (0) p ( m −1−i ) (0) = (i ) (0) p1 1 i =0 = r1 (0) p1 (m) ( 0) + m −1 (m − 1)! ∑ i!(m − 1 − i)! r 1 ( m −1− i ) ( 0) . i =0 It follows from the last equation taking into account the assumption that p ( m ) (0) = p1 (m) ( 0) . Therefore the last equation is fulfilled for all m∈N by the principle of mathematical induction. Analogously it can be proven using Equations (3.11) and (3.13) that p ( m ) (1) = p 2 (m) (1) . for all m∈N. Thus Equations (3.3) are also fulfilled. Figure 2 shows some curves constructed by means of blending two conic arcs with the polynomials wn(u). Figure 2. Blending conic arcs by means of the polynomials wn(u) 4. BÉZIER REPRESENTATION OF BLENDED CONIC ARCS The purpose of this section is to obtain a rational Bézier representation of the blending parametric curve p(u) described by Equation (3.5). In order to solve the problem consider a homogeneous representation x(u) of the parametric curve p(u) which is described by Equation (3.6). Using Equation (2.3) the homogeneous representation can be transformed as follows: x (u ) = (1 − wn (u )) x1 (u ) + wn (u ) x 2 (u ) = = wn (1 − u ) x1 (u ) + wn (u ) x 2 (u ) = 6
  • 7. International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013 = = + = + = + n −1 ∑b k =0 n −1 ∑b k =0 2 n −1 2 n −1, k (u )(b2,0 (u ) x 0 + b2,1 (u ) x1,1 + b2, 2 (u ) x 2 ) + k =n 2 n −1 2 n −1, k ∑b ∑b 2 n −1, k (u )b2,1 (u ) x 2,1 + (u ) x 2 (u ) = n −1 ∑b k =0 2 n −1 (u )c 0,k x 0 + 2 n −1, k n ∑b (u )c1,k x 2,1 + 2 n +1, k 2 n −1, k ∑b k =0 2 n +1, k ∑b 2 n −1, k (u )(b2,0 (u ) x 0 + b2,1 (u ) x 2,1 + b2, 2 (u ) x 2 ) = (u )b2,0 (u ) x 0 + ∑b k = n +1 k =n 2 n −1, k k =0 2 n −1 k =0 2n ∑b (u ) x1 (u ) + ∑b k =n 2 n −1 2 n −1 2 n −1, k k =1 2 n +1 2 n +1, k ∑b k =2 2 n +1, k (u )b2,1 (u ) x1,1 + (u )b2, 2 (u ) x 2 = (u )c1,k x1,1 + (u )c 2,k x 2 Where ( 2n − k )(2n − k + 1) , 0 ≤ k ≤ 2n − 1 , 2n( 2n + 1) k ( 2n − k + 1) , 1 ≤ k ≤ 2n , = n( 2n + 1) ( k − 1) k , 2 ≤ k ≤ 2n + 1 . = 2n( 2n + 1) c 0, k = c1,k c 2, k It follows from the last equations that the parametric curve x(u) has the following Bézier representation: x (u ) = b2 n +1,0 (u ) x 0 + b2 n +1,1 (u )(c0,1 x 0 + c1,1 x1,1 ) + + n ∑b k =2 + 2 n +1, k (u )(c 0,k x 0 + c1,k x1,1 + c 2,k x 2 ) + 2 n −1 ∑b k = n +1 2 n +1, k (u )(c 0,k x 0 + c1,k x 2,1 + c 2,k x 2 ) + + b2 n +1, 2 n (u )(c1, 2 n x 2,1 + c 2, 2 n x 2 ) + b2 n +1, 2 n +1 (u ) x 2 . Then transition to Cartesian coordinates yields that the blending parametric curve p(u) has the following rational Bézier representation: r (u ) , u ∈ [0,1] , (4.1) p(u ) = r (u ) where r (u ) = b2 n +1,0 (u ) w0 p0 + b2 n +1,1 (u )(c0,1 w0 p0 + c1,1 w1,1 p1,1 ) + + + n ∑b k =2 2 n −1 2 n +1, k ∑b k = n +1 (u )(c 0,k w0 p0 + c1,k w1,1 p1,1 + c 2,k w2 p 2 ) + 2 n +1, k (u )(c 0,k w0 p0 + c1,k w2,1 p 2,1 + c 2,k w2, 2 p 2 ) + 7
  • 8. International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013 + b2 n +1, 2 n (u )(c1, 2 n w2,1 p 2,1 + c 2, 2 n w2 p 2 ) + b2 n +1, 2 n +1 (u ) w2 p 2 (4.2) and r (u ) = b2 n +1,0 (u ) w0 + b2 n +1,1 (u )(c 0,1 w0 + c1,1 w1,1 ) + + + n ∑b k =2 2 n −1 2 n +1, k ∑b k = n +1 (u )(c 0,k w0 + c1,k w1,1 + c 2,k w2 ) + 2 n +1, k (u )(c 0,k w0 + c1,k w2,1 + c 2,k w2, 2 ) + + b2 n +1, 2 n (u )(c1, 2 n w2,1 + c 2, 2 n w2 ) + b2 n +1, 2 n +1 (u ) w2 (4.3) For example, the numerator and denominator of cubic and quintic blending parametric curves have the following Bézier representations: 1 r (u ) = b3,0 (u ) w0 p0 + b3,1 (u ) ( w0 p0 + 2 w1,1 p1,1 ) + 3 1 + b3, 2 (u ) ( 2 w2,1 p 2,1 + w2 p 2 ) + b3,3 (u ) w2 p 2 , 3 1 1 r (u ) = b3,0 (u ) w0 + b3,1 (u ) ( w0 + 2 w1,1 ) + b3, 2 (u ) (2 w2,1 + w2 ) + b3,3 (u ) w2 3 3 and 1 r (u ) = b5,0 (u ) w0 p0 + b5,1 (u ) (3w0 p0 + 2w1,1 p1,1 ) + 5 1 1 + b5, 2 (u ) (3w0 p0 + 6 w1,1 p1,1 + w2 p 2 ) + b5,3 (u ) ( w0 p0 + 6 w2,1 p 2,1 + 3w2 p 2 ) + 10 10 1 + b5, 4 (u ) (2w2,1 p 2,1 + 3w2 p 2 ) + b5,5 (u ) w2 p 2 , 5 1 r (u ) = b5,0 (u ) w0 + b5,1 (u ) (3w0 + 2 w1,1 ) + 5 1 1 + b5, 2 (u ) (3w0 + 6w1,1 + w2 ) + b5,3 (u ) ( w0 + 6w2,1 + 3w2 ) + 10 10 1 + b5, 4 (u ) (2 w2,1 + 3w2 ) + b5,5 (u ) w2 5 respectively. 5. CONSTRUCTION OF TWO SMOOTHLY JOINED CONIC ARCS The purpose of this section is to introduce analytical expressions for construction smoothly joined conic arcs. The expressions will be used for construction spline curves in the next section. Consider three distinct points p0, p1, and p2 with the corresponding weights w0, w1 and w2. The problem is to construct two conic arcs pi(u), i∈{1, 2}, which are represented by means of rational Bézier curves p1 (u ) = p 2 (u ) = (1 − u ) 2 w0 p0 + 2(1 − u )uw1,1 p1,1 + u 2 w1 p1 (1 − u ) 2 w0 + 2(1 − u )uw1,1 + u 2 w1 , u ∈ [0,1] , (1 − u ) 2 w1 p1 + 2(1 − u )uw2,1 p 2,1 + u 2 w2 p 2 (1 − u ) 2 w0 + 2(1 − u )uw2,1 + u 2 w2 , u ∈ [0,1] (5.1) (5.2) and are smoothly joined at the common point p1 that is 8
  • 9. International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013 p1 (n) (1) = p 2 (n) ( 0) , n ∈ N . (5.3) In order to find control points p1,1, and p2,1 which ensure the necessary smooth junction represent the conic arcs arcs p1(u) and p2(u) using homogeneous coordinates as follows x1 (u ) = (1 − u ) 2 x 0 + 2(1 − u )ux1,1 + u 2 x1 , u ∈ [0,1] , x 2 (u ) = (1 − u ) 2 x1 + 2(1 − u )ux 2,1 + u 2 x 2 , u ∈ [0,1] . The conic arcs arcs x1(u) and x2(u) are smoothly joined at the point x1 only provided that the following two conditions: ′ ′ x1 (1) = x ′ (0) , x1′(1) = x ′′ (0) . 2 2 (5.4) are fulfilled. Resolution of these equations yields the following values of unknown control points x1,1 and x2,2 of the quadric Bézier curves x1(u) and x2(u): x − x0 x − x0 , x 2,1 = x1 + 2 . x1,1 = x1 − 2 4 4 The values of knot points p1,1, and p2,1 can be obtained from these equations by transition to transition to Cartesian coordinates as follows: w2 p 2 − w0 p0 w p − w0 p0 , p 2,1 = w1 p1 + 2 2 . 4 4 w − w0 w − w0 , w2,1 = w1 + 2 . w1,1 = w1 − 2 4 4 p1,1 = w1 p1 − (5.5) (5.6) Show that in this case the conic arcs arcs p1(u) and p2(u) are also smoothly joined at the point p1. For this purpose represent the conic arcs p1(u) and p2(u) as follows: p i (u ) = ri (u ) , i ∈ {1,2} ri (u ) (5.7) where r1 (u ) = (1 − u ) 2 w0 p 0 + 2(1 − u )uw1,1 p1,1 + u 2 w1 p1 , r2 (u ) = (1 − u ) 2 w1 p1 + 2(1 − u )uw2,1 p 2,1 + u 2 w2 p 2 and r1 (u ) = (1 − u ) 2 w0 + 2(1 − u )uw1,1 + u 2 w1 , r2 (u ) = (1 − u ) 2 w1 + 2(1 − u )uw2,1 + u 2 w2 . It follows from Equations (5.4) that the first two derivatives of the numerators ri(u) and denominators ri(u) satisfy the following conditions at the common point p1: r1′(1) = r2′ (0) , r1′′(1) = r2′′(0) and (5.8) r1′(1) = r2′ (0) , r1′′(1) = r2′′(0) . (5.9) It is obvious that any of all other higher order derivatives of the numerators ri(u) and denominators ri(u) is equal to zero. Now transform Equation (5.7) as follows: 9
  • 10. International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013 ri (u ) pi (u ) = ri (u ) , i ∈ {1,2} , and find the first derivatives of the equation parts. It is obtained that ri′(u ) pi (u ) + ri (u ) pi′ (u ) = ri′(u ) , i ∈ {1,2} . It follows from these equations taking into account Equations (5.8) and (5.9) that r1′(1) − r1′(1) p1 (1) r2′ (0) − r2′ (0) p 2 (0) = = p ′ ( 0) . 2 r1 (1) r2 (0) Analogously it can be proven that ′ p1 (1) = ′ p1′(1) = p ′′ (0) . 2 Now notice that all higher order derivatives of the conic arcs pi(u) at the common point p1 depends only values of these parametric curves at the common point and the first two derivatives of the numerators ri(u) and denominators ri(u) at the common point. Then taking into account the last two equations it can be stated that Equations (5.3) are also fulfilled. Thus it is obtained that the conic arcs p1(u) and p2(u) are smoothly joined at the common point p1. Since spline curves will be constructed by means of blending conic arcs it is reasonable to consider shape modification of the conic arc by means of changing weights of its knot points. This modification behaves just opposite to the modification of a weight of the conic control point. That is if a weight of the conic control point increases then the conic pulls toward the control point. Otherwise if a weight of the conic control point decreases then the conic pushes away from the control point. Figure 3 shows modification of a conic shape depending on a weight of its control point. Values of the weight are depicted near the knot points. On the other hand if a weight of the conic knot point increases then the conic pushes away from the control point. Otherwise if a weight of the conic knot point decreases then the conic pulls toward the control point. Figure 4 shows modification of a conic shape depending on a weight of its knot point. Now it is clear how weights of knot points influence on shape of two smoothly joined conics. Figure 5 shows modification of two smoothly joined conic shape by means of the weight which is prescribed to the knot point. Figure 3. Modification of conic shape by means of a control point weight 10
  • 11. International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013 Figure 4. Modification of conic shape by means of a knot point weight Figure 5. Modification of two smoothly joined conic shape by means of weights More detailed considerations concerned with modification of rational curve shape by means of weights are presented in the works of Piegl [19], Sánchez-Reyes [20] and Juhász [21]. 6. RATIONAL BÉZIER SPLINE CURVES WITH LOCAL SHAPE CONTROL The purpose of this section is to present a technique for construction of a rational spline curve p(u)∈Cn, n∈N, which interpolates a sequence of knot points pi, i∈{0, 1, 2,..., k}, k∈N, with the corresponding weights wi. In order to solve the problem construct a segment pi(u), 0 < i < k, of the parametric curve p(u) by means of blending two conic arcs pi,1(u) and pi,2(u) as was proposed in Section 3. Figure 6 explains construction a segment pi(u) of the spline curve p(u). Figure 6. Construction of a spline curve segment 11
  • 12. International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013 In order to ensure Cn smoothness of the spline curve p(u) it is necessary to ensure that that the conic arcs pi-1,1(u) and pi,2(u) are smoothly joined at the common point pi. This can be obtained by constructing the conic arcs pi-1,1(u) and pi,2(u) as was proposed in Section 5. Taking into account these considerations define the conic arcs pi,1(u) and pi,2(u) as follows: pi ,1 (u ) = (1 − u ) 2 wi pi + 2(1 − u )uwi ,1 pi ,1 + u 2 wi +1 pi +1 (1 − u ) 2 wi + 2(1 − u )uwi ,1 + u 2 wi +1 , u ∈ [0,1] . for i∈{0, 1,..., k-1} and pi , 2 (u ) = (1 − u ) 2 wi pi + 2(1 − u )uwi , 2 pi , 2 + u 2 wi +1 pi +1 (1 − u ) 2 wi + 2(1 − u )uwi , 2 + u 2 wi +1 , u ∈ [0,1] . for i∈{1, 2,..., k} where the control points pi,1 and pi,2 with the corresponding weights wi,1 and wi,2 are defined using Equations wi +1 pi +1 − wi −1 pi −1 w p − wi −1 pi −1 , pi , 2 = wi pi + i +1 i +1 . 4 4 w − wi −1 w − wi −1 , wi , 2 = wi + i +1 . wi ,1 = wi − i +1 4 4 pi ,1 = wi pi − Then a segment pi(u) of the spline curve p(u) can be defined using Equation (3.5) as follows: pi (u ) = (1 − wn (u ))ri ,1 (u ) + wn (u )ri , 2 (u ) (1 − wn (u ))ri ,1 (u ) + wn (u )ri , 2 (u ) , u ∈ [0,1] , where ri , j (u ) = (1 − u ) 2 wi pi + 2(1 − u )uwi , j pi , j + u 2 wi +1 pi +1 , j ∈ {1,2} , ri , j (u ) = (1 − u ) 2 wi + 2(1 − u )uwi , j + u 2 wi +1 , j ∈ {1,2} . It follows from Equations (3.3) and (5.3) that in this case segments of the parametric curve p(u) satisfy the following condition: pi (n) (1) = pi +1 (0) , n ∈ N . (n) Figure 7 shows how a shape of the spline curve depends on the weight prescribed to the knot point of the spline curve. Weights of all other knot points of the spline curve are equal to the unity. Figure 7. Modification of a spline curve shape by means of weights 12
  • 13. International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013 7. CONCLUSIONS The approach to construction of Cn continuous interpolating spline curves by means of blending rational quadric Bézier curves is introduced. Spline curves are constructed locally which implies local shape control of them by means of weights which are assigned to the knot points of the constructed spline curve. Bézier representation of the considered spline curves is introduced. The presented technique can be used for fast prototyping rational spline Bézier. Besides since the spline curves are constructed locally the presented technique can be also used in real-time geometric applications connected with computer graphics and animation. REFERENCES [1] Pobegailo, A. P., Polynomial blending of parametric curves in linear spaces. BSU, Minsk, 2013. [2] Overhauser, A.W., (1968) “Analytic Definition of Curves and Surfaces by Parabolic Blending”, Tech. Rep. No. SL68-40, Ford Motor Company Scientific Laboratory. [3] Rogers, D.F., Adams, J.A., (1989) Mathematical elements for computer graphics, McGraw-Hill publisher. [4] Chuan Sun, Huanxi Zhao, (2009) “Generating fair, C2 continuous splines by blending conics”, Computers & Graphics, Vol. 33, No. 2, pp. 173–180. [5] Hartmann, E., (2001) “Parametric Gn blending of curves and surfaces”, The Visual Computer, Vol. 17, No. 1, pp. 1-13. [6] Meek, D.S., Walton, D. J., (2009) “Blending two parametric curves”, Computer-Aided Design, Vol. 41, No. 6, pp. 423-431. [7] Tai, C.-L., Barsky, B.A. and Loe, K.F., (2000) “An interpolation method with weights and relaxation parameters”, in A. Cohen et al. (eds.), Curves and surface ftting, Saint-Malo, Vanderbilt Univ. Press, Nashville, pp. 393-402. [8] Habib, Z., Sakai, M. and Sarfraz, M., (2004) “Interactive Shape Control with Rational Cubic Splines”, Computer-Aided Design & Applications, Vol. 1, No. 1-4, pp. 709-718. [9] Habib, Z., Sarfraz, M. and Sakai, M., (2005) “Rational cubic spline interpolation with shape control”, Computers & Graphics, Vol. 29, No. 4, pp. 594-605. [10] Sarfraz, M., (1994) “Generalized geometric interpolation for rational cubic splines”, Computers & Graphics, Vol. 18, No. 1, pp. 61–72. [11] Karčiauskas, K., Peters, J., (2011) “Rational G2 splines”, Graphical Models, Vol. 73, No. 5, pp. 286– 295. [12] Fangxun Bao, Qinghua Sun, Qi Duan, (2009) “Point control of the interpolating curve with a rational cubic spline”, Journal of Visual Communication and Image Representation, Vol. 20, No. 4, pp. 275– 280. [13] Qi Duan, Djidjeli, K., Price, W.G., Twizell, E.H., (2000) “Weighted rational cubic spline interpolation and its application”, Journal of Computational and Applied Mathematics, Vol. 117, No. 2, pp. 121–135. [14] Qi Duan, Fangxun Bao, Shitian Du, Twizell, E.H., (2009) “Local control of interpolating rational cubic spline curves”, Computer-Aided Design, Vol. 41, No. 11, pp. 825–829. [15] Qi Duana, Liqiu Wangb, Twizellc, E.H., (2005) “A new weighted rational cubic interpolation and its approximation”, Applied Mathematics and Computation, Vol. 168, No. 2, pp. 990–1003. [16] Pobegailo, A.P., (1991) “Local interpolation with weight functions for variable-smoothness curve design”, Computer-Aided Design, Vol. 23, No. 8, pp. 579-582. [17] Pobegailo, A.P., (1992) “Geometric modeling of curves using weighted linear and circular segments”, The Visual Computer, Vol. 8, No. 4, pp. 241-245. 13
  • 14. International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 2013 [18] Wiltsche, A., (2005) “Blending curves”, Journal for Geometry and Graphics, Vol. 9, No. 1, pp. 6775. [19] Piegl, L., (1989) “Modifying the shape of rational B-splines. Part 1: curves”, Compuer.-Aided Design, Vol. 21, No. 8, pp. 509-518. [20] Sánchez-Reyes, J., (1997) “A Simple Technique for NURBS Shape Modification”, IEEE Computer Graphics and Applications, Vol. 17, No. 1, pp. 52-59. [21] Juhász, I., (1999) “Weight-based shape modification of NURBS curves”, Computer Aided Geometric Design, Vol. 16, No. 5, pp. 377-383. Authors A. P. Pobegailo graduated from Belarusian State University in 1981. Then he obtained Ph. Degree on system analysis and automatic control. Currently he is an assistant professor at Belarusian State University. He teaches courses on operating systems and systems design. His research interests include computer graphics and geometric design. 14