R.-J. Zhang / Computer Aided Geometric Design 30 (2013) 844–860 847
d
dt
i
H
j
(0) = δ
i, j
, i = 0, 1,...,r; j = 0, 1,...,r,
and
d
dt
i
H
j
(1) = δ
i,2r+1−j
, i = 0, 1,...,r; j = r +1, r +2,...,2r + 1.
Note:
(a) Conditions (5) can
assume that the constructed curve with symmetry about the point P
i
if the set of points P
i
is
symmetric about P
i
. This is a natural and rational requirement.
(b) If P
i
is a set of data with dimension larger than 1, then d
(r)
i
can be viewed as a derivative vector. In the later, if P
i
is
a set of data with dimension one, we denote it by y
i
.
The above method to construct curves has the following properties.
(2.1) The constructed curve P
(t) is an interpolatory curve which exactly passes through all the given points, and is
symmetric about the point P
i
if the set of points P
i
is symmetric about the point P
i
.
(2.2) The curve P
(t) is at least C
r
continuous. According to the construction procedure, Properties (1) and (2) are obvious.
(2.3) Local shape adjustable. If we move one point P
i
, the curve only changes its shape which lies between P
i−T
and
P
i+T
locally. Where
T =
max
r
(
r
2
+ s(r) + 1), r is even;
max
r
(
r+1
2
+ s(r) + 1), r is odd.
(7)
It is easily observed from Eq. (4) that moving the point P
i
only changes d
( j)
i−T +1
,...,d
( j)
i
,...,d
( j)
i+T −1
, j = 1, 2,...,r,sothe
conclusion is valid.
We now introduce the symbol
{P
i
}={...,P
i−1
, P
i
, P
i+1
,...}, which denotes a given set of points, and then define the
addition of the two sets of
{P
1
i
}={...,P
1
i
−1
, P
1
i
, P
1
i
+1
,...} and {P
2
i
}={...,P
2
i
−1
, P
2
i
, P
2
i
+1
,...} as
P
1
i
+
P
2
i
=
...,
P
1
i
−1
+ P
2
i
−1
, P
1
i
+ P
2
i
, P
1
i
+1
+ P
2
i
+1
,...
.
(2.4) Additivity. If we construct two curves P
1
(t) and P
2
(t) by the method above from the two sets of data points {P
1
i
}
and {P
2
i
} respectively, then P
1
(t) + P
2
(t) is the curve passing through the set of data points {P
1
i
}+{P
2
i
}.
Proof. Le
t d
(r)
i,1
and d
(r)
i,2
, which defined by Eq. (4), refer to the set of points P
1
i
and P
2
i
respectively. d
(r)
i
refer to the set of
points P
1
i
+ P
2
i
. It is easy to see that
d
(r)
i
=d
(r)
i,1
+d
(r)
i,2
.
Then the conclusion derives from Eq. (6).
(2.5) If P
(t) is a curve passing through a set of {P
i
},thenc · P (t) is a curve passing through a set of c ·{P
i
}, where c is
a constant.
Notice that d
(r)
i
is a linear combination of {P
i
},byEq.(6), the conclusion is obvious.
(2.6) Second order precision. If the set of data points P
i
is evenly taken from the straight line y = x or the parabolic line
y
= x
2
, then the curve P(t) reproduces the curve if r 2inthemethod.Notingd
(1)
i
= constant for P
i
= i, and d
(1)
i
= 2i
and d
(2)
i
= 2forP
i
= i
2
. So the parabolic line can be reproduced exactly. The cubic curve y = x
3
can only be approximately
reconstructed because its various order derivatives do not be estimated exactly. Fig. 2 shows these results.
Applying the formula of transforming Hermite polynomials to Bernstein basis (Chang,
1984)
H
2r+1
k
(t) =
(
2r +1 −k)!
(2r + 1)!
r
i=k
B
2r+1
i
(t)
i
k
,
k = 0, 1,...,r (8)
and
H
2r+1
k
(t) = (−1)
k+1
k!
(2r + 1)!
r
i=2r+1−k
B
2r+1
2r
+1−i
(t)
i
2r
+1 −k
,
k = r + 1, r + 2,...,2r +1, (9)
where B
n
i
(t) =
n
i
(
1 − t)
n−i
t
i
are Bernstein basis functions. We can rewrite curve equation (6) as in the Bézier form. For
later use, we only give two formulas in the matrix form according to Eqs. (8) and (9) for r
= 1 and r = 2, respectively:
⎛
⎜
⎜
⎜
⎝
H
3
0
H
3
1
H
3
2
H
3
3
⎞
⎟
⎟
⎟
⎠
=
⎛
⎜
⎜
⎜
⎝
11 0 0
0
1
3
00
00
−
1
3
0
00 1 1
⎞
⎟
⎟
⎟
⎠
⎛
⎜
⎜
⎜
⎝
B
3
0
B
3
1
B
3
2
B
3
3
⎞
⎟
⎟
⎟
⎠
(10)