# Quartic Rational Said-Ball-Like Basis with Tension Shape Parameters and Its Application

Authors: Yuanpeng Zhu; Xuli Han; Shengjun Liu
Journal: Journal of Applied Mathematics
 (2014)

---

## Abstract

Four new quartic rational Said-Ball-like basis functions, which include the cubic Said-Ball basis functions as a special case, are constructed in this paper. The new basis is applied to generate a class ofC
1 continuous quartic rational Hermite interpolation splines with local tension shape parameters. The error estimate expression of the proposed interpolant is given and the sufficient conditions are derived for constructing a C
1 positivity- or monotonicity- preserving interpolation spline. In addition, we extend the quartic rational Said-Ball-like basis to a triangular domain which has three tension shape parameters and includes the cubic triangular Said-Ball basis as a special case. In order to compute the corresponding patch stably and efficiently, a new de Casteljau-type algorithm is developed. Moreover, the G
1 continuous conditions are deduced for the joining of two patches.


---

## Body

## 1. Introduction

Constructing practical basis functions to generate free form curves and surfaces is an important topic of CAGD (computer aided geometric design) and computer graphics. Generally speaking, the basis function with good properties plays a vital role in curve and surface design. In [1–3], Ball introduced a kind of cubic rational polynomial to be the basis of CONSURF surface lofting program. In [4], Said extended the cubic basis proposed by Ball into arbitrary odd degree basis to get a type of generalized Ball basis. After that, Goodman and Said proved that the generalized Ball basis is normalized totally positive and hence it possesses the same kind of shape preserving properties as the Bernstein basis [5]. In [6], Hu and his colleagues suggested an extension of the generalized Ball basis to arbitrary even degree, usually known as Said-Ball basis. In [7], based on the necessary and sufficient conditions for the conic representation in a rational low degree Bézier form and the transformation formula from Bernstein basis to Said-Ball basis, Hu and Wang deduced the representation theory of rational cubic and quartic Said-Ball conics. Because surfaces modeling over a triangular domain have great potential of constructing complex shapes, there are some researchers who have put many efforts on the establishments of triangular Said-Ball bases. In [8], Goodman and Said defined a bivariate Said-Ball basis on a triangle and designed a triangular Said-Ball surface based on the research of Said-Ball curve. In [9], Hu et al. extended the univariate Wang-Ball basis to the bivariate case on a triangle, designed a triangular Wang-Ball surface, and pointed out its virtues. Chen and Wang [10] constructed a class of triangular DP surfaces. Recently, Zhu and Han [11] constructed a class of α
β
γ-Bernstein-Bézier basis possessing three-exponential-shape parameters over a triangular domain, which includes the cubic triangular Said-Ball basis and the cubic triangular Bernstein-Bézier basis as special cases.In industrial design and scientific data visualization, constructing shape preserving interpolation splines for the interpolation of positive or monotonic data is an essential problem and has attracted widespread interest. In [12], Schmidt and Heß derived a necessary and sufficient criterion under which a kind of C
1 quadratic rational positivity-preserving interpolation spline was developed. Sakai and Schmidt [13] proposed a method for the construction of positive cubic rational splines of continuity class C
2. In [14, 15], two kinds of C
1 rational cubic interpolation splines were constructed by Hussain and Sarfraz to visualize the positive data. In [16], Fritsch and Carlson gave necessary and sufficient conditions for a cubic spline to be monotone on an interval. Manni and Sablonnière [17] developed an explicit expression of a C
1 cubic rational spline which can be applied to monotonic data. In [18, 19], two kinds of C
2 cubic rational interpolation splines were proposed by Sarfraz for the visualization of monotonic data. In [20], Hussain and Sarfraz presented a C
1 cubic rational interpolating scheme to deal with the problem of monotonicity. In [21], by using weighted C
1 quadratic splines, Kvasov proposed two algorithms with automatic selection of the shape parameters to construct a shape preserving interpolation spline for monotonic or convex data. Recently, the quadratic and cubic rational trigonometric bases are also considered by some scholars to construct positivity-preserving and monotonicity-preserving interpolation splines; see [22–24].The purpose of this paper is to present four new quartic rational Said-Ball-like basis functions with two-tension-shape parameters, which include the cubic Said-Ball basis functions. By using the new basis, a class ofC
1 continuous quartic rational Hermite interpolation spline with local tension shape parameters is also constructed. Its error estimate expression is given and sufficient conditions for constructing a C
1 positivity- or monotonicity-preserving interpolation spline are derived. The quartic rational Said-Ball-like basis functions are also extended to a triangular domain. In order to compute the corresponding patch stably and efficiently, a new de Casteljau-type algorithm is developed.The rest of this paper is organized as follows. Section2 gives the definition and properties of the new quartic rational Said-Ball-like basis and discusses the properties of the corresponding quartic rational Said-Ball-like curve. In Section 3, based on the new proposed quartic rational Said-Ball-like basis, a new class of C
1 quartic rational Hermite interpolation spline is developed. Sufficient conditions are derived for constructing a C
1 positivity- or monotonicity-preserving interpolation spline. Section 4 gives the construction and properties of the quartic rational Said-Ball-like basis functions over a triangular domain. The conditions for G
1 continuously and smoothly joining of two quartic rational triangular Said-Ball-like patches are deduced. Conclusion is given in Section 5.


## 2. Quartic Rational Said-Ball-Like Basis

### 2.1. Construction of the Basis

We construct four new quartic rational Said-Ball-like basis functions as follows.Definition 1.
For anyα
,
β
∈
[
0
,
+
∞
), t
∈
[
0,1
], the new quartic rational Said-Ball-like basis functions are given by
(1)
B
0
(
t
)
=
(
1
-
t
)
2
1
+
α
t
,
B
1
(
t
)
=
(
1
-
t
)
2
t
1
+
α
t
(
2
+
α
+
2
α
t
)
,
B
2
(
t
)
=
(
1
-
t
)
t
2
1
+
β
(
1
-
t
)
[
2
+
β
+
2
β
(
1
-
t
)
]
,
B
3
(
t
)
=
t
2
1
+
β
(
1
-
t
)
.Notice that(2)
B
1
(
t
)
=
1
-
3
t
2
+
2
t
3
-
B
0
(
t
)
,
B
2
(
t
)
=
3
t
2
+
2
t
3
-
B
3
(
t
)
;
we can see immediately that the quartic rational Said-Ball-like basis functions (1) are constructed in the function space span {
1,3
t
2
-
2
t
3
,
(
1
-
t
)
2
/
(
1
+
α
t
)
,
t
2
/
[
1
+
β
(
1
-
t
)
]
}. It is easy to check that, for α
=
β
=
0, the quartic rational Said-Ball-like basis is precisely the cubic Said-Ball basis; see [1–3].For convenience, in the following discussion we will also denote the four quartic rational Said-Ball-like basis functions asB
i
(
t
;
α
,
β
), i
=
0,1
,
2,3, or B
i
(
t
;
α
), i
=
0,1, and B
i
(
t
;
β
), i
=
3,4. Figure 1 shows some plots of the new basis functions for some values of the shape parameters.Some plots of the new quartic rational Said-Ball-like basis functions.
(a)
(b)
(c)
(d)From the definition of the quartic rational Said-Ball-like basis given in (1), we have the following important properties of the new basis.Theorem 2.
The quartic rational Said-Ball-like basis (1) has the following properties. (a)
Partition of unity:∑
i
=
0
3
‍
B
i
(
t
;
α
,
β
)
=
1.
(b)
Nonnegativity:B
i
(
t
;
α
,
β
)
≥
0, i
=
0,1
,
2,3.
(c)
Symmetry:B
i
(
t
;
α
,
β
)
=
B
3
-
i
(
1
-
t
;
β
,
α
), for i
=
0,1.
(d)
Linear independence: forα
,
β
∈
(
2
,
+
∞
), the quartic rational Said-Ball-like basis functions B
i
(
t
;
α
,
β
), i
=
0,1
,
2,3, are linearly independent.Proof.
It is easy to check that the basis (1) has the properties of partition of unity, nonnegativity, and symmetry. In addition, for any α
,
β
∈
[
0
,
+
∞
), ξ
i
∈
R
(
i
=
0,1
,
2,3
), we consider a linear combination
(3)
∑
i
=
0
3
‍
ξ
i
B
i
(
t
;
α
,
β
)
=
0
.
Differentiating with respect to the variable t on both sides, we have
(4)
∑
i
=
0
3
‍
ξ
i
B
i
′
(
t
;
α
,
β
)
=
0
.
For t
=
0, from (3) and (4), we can obtain the following system of equations with respect to ξ
0 and ξ
1:
(5)
ξ
0
=
0
,
(
2
+
α
)
(
ξ
1
-
ξ
0
)
=
0
.
Then, we have ξ
0
=
ξ
1
=
0. Similarly, for t
=
1, we can get ξ
2
=
ξ
3
=
0. Thus, the basis functions (1) are linearly independent.


### 2.2. Definition and Properties of the Quartic Rational Said-Ball-Like Curve

Definition 3.
Given control pointsQ
i
(
i
=
0,1
,
2,3
) in R
2 or R
3, then
(6)
R
(
t
;
α
,
β
)
=
∑
i
=
0
3
‍
B
i
(
t
;
α
,
β
)
Q
i
,
t
∈
[
0,1
]
,
α
,
β
∈
[
0
,
+
∞
)
is called a quartic rational Said-Ball-like curve with two shape parameters α and β.Since the quartic rational Said-Ball-like basis (1) has the properties of partition of unity and nonnegativity, we can see that the corresponding curve (6) defined by it has the properties of affine invariance and convex hull, which are crucial properties in curve design. Direct computation gives the following end-point property of the quartic rational Said-Ball-like curve:
(7)
R
(
0
;
α
,
β
)
=
Q
0
,
R
(
1
;
α
,
β
)
=
Q
3
,
R
′
(
0
;
α
,
β
)
=
(
2
+
α
)
(
Q
1
-
Q
0
)
,
R
′
(
1
;
α
,
β
)
=
(
2
+
β
)
(
Q
3
-
Q
2
)
.
These imply that for any α
,
β
∈
[
0
,
+
∞
) the curve has the end-point interpolation property and  Q
0
Q
1, Q
2
Q
3 are the tangent lines of the curve at the points  Q
0, Q
3, respectively. From these, we can find that the quartic rational Said-Ball-like curve has some properties analogous to that of the cubic Said-Ball curve. For α
=
β
=
0, the quartic rational Said-Ball-like curve, specially, is just the cubic Said-Ball curve.For the analysis of the effect of the shape parameters on the shape of the obtained quartic rational Said-Ball-like curve, we rewrite (6) as follows:
(8)
R
(
t
;
α
,
β
)
=
(
1
-
t
)
2
(
1
+
2
t
)
Q
1
+
t
2
(
3
-
2
t
)
Q
2
+
B
0
(
t
;
α
)
(
Q
0
-
Q
1
)
+
B
3
(
t
;
β
)
(
Q
3
-
Q
2
)
.From (8), it is obvious that the shape parameters α and β only affect the curve on the control edges Q
0
-
Q
1 and Q
3
-
Q
2, respectively. Moreover, B
0
(
t
;
α
) decreases with the increase of α for any fixed t
∈
(
0,1
), which indicates that the curve moves in the same direction of the edge Q
0
-
Q
1 as α increases. Inversely, as α decreases, the curve moves in the opposite direction to the edge Q
0
-
Q
1. The shape parameter β has similar effects on the edge Q
3
-
Q
2. When the shape parameters satisfy α
=
β, the curve moves in the same direction or the opposite direction to the edge Q
2
-
Q
1 when α increases or decreases, respectively. And when α,  β increase at the same time, the curve tends to the edge Q
2
-
Q
1. Thus we can see that the shape parameters α and β serve as local tension parameters. Figure 2 shows the effect of the shape parameters on the quartic rational Said-Ball-like curves.The effect of shape parameters on the quartic rational Said-Ball-like curves.
(a)
(b)Corner cutting algorithm is an efficient and stable process for computing the quartic rational Said-Ball-like curve. In order to develop such an algorithm, we rewrite the quartic rational Said-Ball-like curve (6) in the following matrix form:
(9)
R
(
t
;
α
,
β
)
=
(
1
-
t
t
)
(
1
-
t
t
0
0
1
-
t
t
)
×
(
1
1
+
α
t
α
t
1
+
α
t
0
0
0
1
-
t
t
0
0
0
β
(
1
-
t
)
1
+
β
(
1
-
t
)
1
1
+
β
(
1
-
t
)
)
×
(
Q
0
Q
1
Q
2
Q
3
)
.
From (9), we can immediately obtain a corner cutting algorithm for computing the quartic rational Said-Ball-like curve. See Figure 3 for an illustration of this algorithm.Corner cutting algorithm.
(a)
(b)
(c)
(d)Control polygons provide an important tool in geometric modeling. Here, we adopt the method given in [25] to show some relations of the quartic rational Said-Ball-like curves and the classical cubic Bézier curves corresponding to the same control polygons.Suppose that the control pointsQ
i
(
i
=
0,1
,
2,3
) are not collinear; let A
(
t
) be a cubic Bézier curve A
(
t
)
=
∑
i
=
0
3
‍
Q
i
(
3
i
)
(
1
-
t
)
3
-
i
t, where t
∈
[
0,1
] and R
(
t
;
α
,
β
) with the same control points Q
i
(
i
=
0,1
,
2,3
). Then, it is easy to show that R
(
0
;
α
,
β
)
=
A
(
0
)
,
R
(
1
;
α
,
β
)
=
A
(
1
). Moreover, according to a simple computation, we have
(10)
R
(
1
2
;
α
,
α
)
-
Q
*
=
f
(
α
)
[
A
(
1
2
)
-
Q
*
]
,
where Q
*
=
(
1
/
2
)
(
P
1
+
P
2
),  f
(
α
)
=
4
/
(
2
+
α
).From (10), we can see that if f
(
α
)
<
1, that is, α
>
2, then the quartic rational Said-Ball-like curves R
(
t
;
α
,
α
) will be closer to the control polygon than the cubic Bézier curve A
(
t
).Figure4 shows the comparisons between the quartic rational Said-Ball-like curves and the cubic Bézier curves. It is clear that, by changing the shape parameters, the quartic rational Said-Ball-like curves can yield tight envelopes for the cubic Bézier curves. Figure 5 shows the comparisons between the quartic rational Said-Ball-like curves (solid lines and dash-dotted lines) and the cubic trigonometric Bézier curves with two shape parameters λ and μ given in [25] (dashed lines and dotted lines). Clearly, the quartic rational Said-Ball-like curves can be closer to the control polygon than the cubic trigonometric Bézier curves.Comparisons between the quartic rational Said-Ball-like curves and the cubic Bézier curves.
(a)
(b)Comparisons between the quartic rational Said-Ball-like curves and the cubic trigonometric Bézier curves with two shape parametersλ and μ given in [25].
(a)
(b)


## 2.1. Construction of the Basis

We construct four new quartic rational Said-Ball-like basis functions as follows.Definition 1.
For anyα
,
β
∈
[
0
,
+
∞
), t
∈
[
0,1
], the new quartic rational Said-Ball-like basis functions are given by
(1)
B
0
(
t
)
=
(
1
-
t
)
2
1
+
α
t
,
B
1
(
t
)
=
(
1
-
t
)
2
t
1
+
α
t
(
2
+
α
+
2
α
t
)
,
B
2
(
t
)
=
(
1
-
t
)
t
2
1
+
β
(
1
-
t
)
[
2
+
β
+
2
β
(
1
-
t
)
]
,
B
3
(
t
)
=
t
2
1
+
β
(
1
-
t
)
.Notice that(2)
B
1
(
t
)
=
1
-
3
t
2
+
2
t
3
-
B
0
(
t
)
,
B
2
(
t
)
=
3
t
2
+
2
t
3
-
B
3
(
t
)
;
we can see immediately that the quartic rational Said-Ball-like basis functions (1) are constructed in the function space span {
1,3
t
2
-
2
t
3
,
(
1
-
t
)
2
/
(
1
+
α
t
)
,
t
2
/
[
1
+
β
(
1
-
t
)
]
}. It is easy to check that, for α
=
β
=
0, the quartic rational Said-Ball-like basis is precisely the cubic Said-Ball basis; see [1–3].For convenience, in the following discussion we will also denote the four quartic rational Said-Ball-like basis functions asB
i
(
t
;
α
,
β
), i
=
0,1
,
2,3, or B
i
(
t
;
α
), i
=
0,1, and B
i
(
t
;
β
), i
=
3,4. Figure 1 shows some plots of the new basis functions for some values of the shape parameters.Some plots of the new quartic rational Said-Ball-like basis functions.
(a)
(b)
(c)
(d)From the definition of the quartic rational Said-Ball-like basis given in (1), we have the following important properties of the new basis.Theorem 2.
The quartic rational Said-Ball-like basis (1) has the following properties. (a)
Partition of unity:∑
i
=
0
3
‍
B
i
(
t
;
α
,
β
)
=
1.
(b)
Nonnegativity:B
i
(
t
;
α
,
β
)
≥
0, i
=
0,1
,
2,3.
(c)
Symmetry:B
i
(
t
;
α
,
β
)
=
B
3
-
i
(
1
-
t
;
β
,
α
), for i
=
0,1.
(d)
Linear independence: forα
,
β
∈
(
2
,
+
∞
), the quartic rational Said-Ball-like basis functions B
i
(
t
;
α
,
β
), i
=
0,1
,
2,3, are linearly independent.Proof.
It is easy to check that the basis (1) has the properties of partition of unity, nonnegativity, and symmetry. In addition, for any α
,
β
∈
[
0
,
+
∞
), ξ
i
∈
R
(
i
=
0,1
,
2,3
), we consider a linear combination
(3)
∑
i
=
0
3
‍
ξ
i
B
i
(
t
;
α
,
β
)
=
0
.
Differentiating with respect to the variable t on both sides, we have
(4)
∑
i
=
0
3
‍
ξ
i
B
i
′
(
t
;
α
,
β
)
=
0
.
For t
=
0, from (3) and (4), we can obtain the following system of equations with respect to ξ
0 and ξ
1:
(5)
ξ
0
=
0
,
(
2
+
α
)
(
ξ
1
-
ξ
0
)
=
0
.
Then, we have ξ
0
=
ξ
1
=
0. Similarly, for t
=
1, we can get ξ
2
=
ξ
3
=
0. Thus, the basis functions (1) are linearly independent.


## 2.2. Definition and Properties of the Quartic Rational Said-Ball-Like Curve

Definition 3.
Given control pointsQ
i
(
i
=
0,1
,
2,3
) in R
2 or R
3, then
(6)
R
(
t
;
α
,
β
)
=
∑
i
=
0
3
‍
B
i
(
t
;
α
,
β
)
Q
i
,
t
∈
[
0,1
]
,
α
,
β
∈
[
0
,
+
∞
)
is called a quartic rational Said-Ball-like curve with two shape parameters α and β.Since the quartic rational Said-Ball-like basis (1) has the properties of partition of unity and nonnegativity, we can see that the corresponding curve (6) defined by it has the properties of affine invariance and convex hull, which are crucial properties in curve design. Direct computation gives the following end-point property of the quartic rational Said-Ball-like curve:
(7)
R
(
0
;
α
,
β
)
=
Q
0
,
R
(
1
;
α
,
β
)
=
Q
3
,
R
′
(
0
;
α
,
β
)
=
(
2
+
α
)
(
Q
1
-
Q
0
)
,
R
′
(
1
;
α
,
β
)
=
(
2
+
β
)
(
Q
3
-
Q
2
)
.
These imply that for any α
,
β
∈
[
0
,
+
∞
) the curve has the end-point interpolation property and  Q
0
Q
1, Q
2
Q
3 are the tangent lines of the curve at the points  Q
0, Q
3, respectively. From these, we can find that the quartic rational Said-Ball-like curve has some properties analogous to that of the cubic Said-Ball curve. For α
=
β
=
0, the quartic rational Said-Ball-like curve, specially, is just the cubic Said-Ball curve.For the analysis of the effect of the shape parameters on the shape of the obtained quartic rational Said-Ball-like curve, we rewrite (6) as follows:
(8)
R
(
t
;
α
,
β
)
=
(
1
-
t
)
2
(
1
+
2
t
)
Q
1
+
t
2
(
3
-
2
t
)
Q
2
+
B
0
(
t
;
α
)
(
Q
0
-
Q
1
)
+
B
3
(
t
;
β
)
(
Q
3
-
Q
2
)
.From (8), it is obvious that the shape parameters α and β only affect the curve on the control edges Q
0
-
Q
1 and Q
3
-
Q
2, respectively. Moreover, B
0
(
t
;
α
) decreases with the increase of α for any fixed t
∈
(
0,1
), which indicates that the curve moves in the same direction of the edge Q
0
-
Q
1 as α increases. Inversely, as α decreases, the curve moves in the opposite direction to the edge Q
0
-
Q
1. The shape parameter β has similar effects on the edge Q
3
-
Q
2. When the shape parameters satisfy α
=
β, the curve moves in the same direction or the opposite direction to the edge Q
2
-
Q
1 when α increases or decreases, respectively. And when α,  β increase at the same time, the curve tends to the edge Q
2
-
Q
1. Thus we can see that the shape parameters α and β serve as local tension parameters. Figure 2 shows the effect of the shape parameters on the quartic rational Said-Ball-like curves.The effect of shape parameters on the quartic rational Said-Ball-like curves.
(a)
(b)Corner cutting algorithm is an efficient and stable process for computing the quartic rational Said-Ball-like curve. In order to develop such an algorithm, we rewrite the quartic rational Said-Ball-like curve (6) in the following matrix form:
(9)
R
(
t
;
α
,
β
)
=
(
1
-
t
t
)
(
1
-
t
t
0
0
1
-
t
t
)
×
(
1
1
+
α
t
α
t
1
+
α
t
0
0
0
1
-
t
t
0
0
0
β
(
1
-
t
)
1
+
β
(
1
-
t
)
1
1
+
β
(
1
-
t
)
)
×
(
Q
0
Q
1
Q
2
Q
3
)
.
From (9), we can immediately obtain a corner cutting algorithm for computing the quartic rational Said-Ball-like curve. See Figure 3 for an illustration of this algorithm.Corner cutting algorithm.
(a)
(b)
(c)
(d)Control polygons provide an important tool in geometric modeling. Here, we adopt the method given in [25] to show some relations of the quartic rational Said-Ball-like curves and the classical cubic Bézier curves corresponding to the same control polygons.Suppose that the control pointsQ
i
(
i
=
0,1
,
2,3
) are not collinear; let A
(
t
) be a cubic Bézier curve A
(
t
)
=
∑
i
=
0
3
‍
Q
i
(
3
i
)
(
1
-
t
)
3
-
i
t, where t
∈
[
0,1
] and R
(
t
;
α
,
β
) with the same control points Q
i
(
i
=
0,1
,
2,3
). Then, it is easy to show that R
(
0
;
α
,
β
)
=
A
(
0
)
,
R
(
1
;
α
,
β
)
=
A
(
1
). Moreover, according to a simple computation, we have
(10)
R
(
1
2
;
α
,
α
)
-
Q
*
=
f
(
α
)
[
A
(
1
2
)
-
Q
*
]
,
where Q
*
=
(
1
/
2
)
(
P
1
+
P
2
),  f
(
α
)
=
4
/
(
2
+
α
).From (10), we can see that if f
(
α
)
<
1, that is, α
>
2, then the quartic rational Said-Ball-like curves R
(
t
;
α
,
α
) will be closer to the control polygon than the cubic Bézier curve A
(
t
).Figure4 shows the comparisons between the quartic rational Said-Ball-like curves and the cubic Bézier curves. It is clear that, by changing the shape parameters, the quartic rational Said-Ball-like curves can yield tight envelopes for the cubic Bézier curves. Figure 5 shows the comparisons between the quartic rational Said-Ball-like curves (solid lines and dash-dotted lines) and the cubic trigonometric Bézier curves with two shape parameters λ and μ given in [25] (dashed lines and dotted lines). Clearly, the quartic rational Said-Ball-like curves can be closer to the control polygon than the cubic trigonometric Bézier curves.Comparisons between the quartic rational Said-Ball-like curves and the cubic Bézier curves.
(a)
(b)Comparisons between the quartic rational Said-Ball-like curves and the cubic trigonometric Bézier curves with two shape parametersλ and μ given in [25].
(a)
(b)


## 3.C
1 Quartic Rational Shape Preserving Interpolation Spline

In this section, based on the quartic rational Said-Ball-like basis given in (1), we will construct a kind of C
1 quartic rational Hermite interpolation spline. Meanwhile, sufficient conditions are also derived for constructing the interpolation spline which can preserve the shape of positive or monotonic set of data.


### 3.1.C
1 Quartic Rational Hermite Interpolation Spline and Convergence Analysis

Letf
i
∈
R, i
=
1
,
…
,
n, be data given at the distinct knots x
i
∈
R, i
=
1
,
…
,
n, with interval spacing h
i
=
x
i
+
1
-
x
i
>
0, and let d
i
∈
R denote the first derivative values defined at the knots. By using the basis given in (1), we construct a quartic rational Hermite interpolation spline H
:
R
→
R as follows:
(11)
H
(
x
)
|
[
x
i
,
x
i
+
1
]
=
B
0
(
t
;
α
i
)
f
i
+
B
1
(
t
;
α
i
)
(
f
i
+
h
i
2
+
α
i
d
i
)
+
B
2
(
t
;
α
i
+
1
)
(
f
i
+
1
-
h
i
2
+
α
i
+
1
d
i
+
1
)
+
B
3
(
t
;
α
i
+
1
)
f
i
+
1
,
where t
=
(
x
-
x
i
)
/
h
i, α
i
,
α
i
+
1
∈
[
0
,
+
∞
),  i
=
1,2
,
…
,
n
-
1.The spline given in (11) is a C
1 Hermite interpolation spline as it satisfies the following interpolatory properties:
(12)
H
(
x
i
)
=
f
i
,
H
(
x
i
+
1
)
=
f
i
+
1
,
H
′
(
x
i
)
=
d
i
,
H
′
(
x
i
+
1
)
=
d
i
+
1
.
And it can be easily checked that, for α
i
=
α
i
+
1
=
0, the quartic rational Hermite interpolation spline is exactly the classical cubic Hermite interpolation spline.Here, all tangent informationd
i is computed from the given data (
x
i
,
f
i
), i
=
1,2
,
…
,
n, as follows:
(13)
d
1
=
f
2
-
f
1
h
1
,
d
i
=
1
h
i
-
1
+
h
i
[
h
i
f
i
-
f
i
-
1
h
i
-
1
+
h
i
-
1
f
i
+
1
-
f
i
h
i
]
,
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
i
=
2,3
,
…
,
n
-
1
,
d
n
=
f
n
-
f
n
-
1
h
n
-
1
,
which is used usually for generating Hermite interpolation curves.In practical applications, the corner cutting algorithm given in (9) can be used to compute the quartic rational Hermite interpolation spline H
(
x
) effectively and stably. From (11), it is obvious that the shape parameter α
i only affects two associated curve segments. As α
i increases, the curve H
(
x
) is pulled towards the point H
(
x
i
) in the neighborhood of the knot position x
i. In other words, the shape parameter α
i serves as a local tension shape parameter.Next, we will make a convergence analysis on the quartic rational Hermite interpolation splineH
(
x
). Let f
(
x
) be a given function to which H
(
x
) is compared. For i
=
1,2
,
…
,
n, we denote f
i
=
f
(
x
i
), f
i
′
=
f
′
(
x
i
) and write
(14)
∥
f
(
4
)
∥
i
,
i
+
1
=
max
⁡
x
i
≤
x
≤
x
i
+
2
|
f
(
4
)
(
x
)
|
,
Δ
i
=
f
i
+
1
-
f
i
h
i
.Theorem 4.
Letf
∈
C
4
[
a
,
b
], for x
∈
[
x
i
,
x
i
+
1
]
,
α
i
,
α
i
+
1
∈
[
0
,
+
∞
)
i
=
1,2
,
…
,
n
-
1; and we have
(15)
|
f
(
x
)
-
H
(
x
)
|
≤
h
i
4
384
∥
f
(
4
)
∥
i
,
i
+
1
+
h
i
4
max
⁡
{
|
f
i
′
-
d
i
|
,
|
f
i
+
1
′
-
d
i
+
1
|
}
+
h
i
8
max
⁡
{
α
i
2
|
d
i
|
2
+
α
i
,
α
i
+
1
2
|
d
i
+
1
|
2
+
α
i
+
1
}
.Proof.
Forx
∈
[
x
i
,
x
i
+
1
], i
=
1,2
,
…
,
n
-
1, let t
=
(
x
-
x
i
)
/
h
i and
(16)
H
3
(
x
)
=
(
1
-
t
)
f
i
+
t
f
i
+
1
-
h
i
(
1
-
t
)
t
×
[
(
1
-
t
)
(
Δ
i
-
d
i
)
+
t
(
d
i
+
1
-
Δ
i
)
]
.
After some computations, we have
(17)
H
(
x
)
=
H
3
(
x
)
+
[
α
i
+
1
2
d
i
+
1
(
2
+
α
i
+
1
)
[
1
+
α
i
+
1
(
1
-
t
)
]
-
α
i
2
d
i
(
2
+
α
i
)
[
1
+
α
i
t
]
]
(
1
-
t
)
2
t
2
h
i
.
With the notationf
i
′
=
f
′
(
x
i
), i
=
1,2
,
…
,
n, let
(18)
H
3
*
(
x
)
=
(
1
-
t
)
f
i
+
t
f
i
+
1
-
h
i
(
1
-
t
)
t
×
[
(
1
-
t
)
(
Δ
i
-
f
i
′
)
+
t
(
f
i
+
1
′
-
Δ
i
)
]
.
SinceH
3
*
(
x
) is the cubic Hermite interpolant to f
(
x
), we have
(19)
|
f
(
x
)
-
H
3
*
(
x
)
|
≤
h
i
4
384
∥
f
(
4
)
∥
i
,
i
+
1
.
It is easy to see that
(20)
|
H
(
x
)
-
H
3
*
(
x
)
|
≤
h
i
4
max
⁡
{
|
f
i
′
-
d
i
|
,
|
f
i
+
1
′
-
d
i
+
1
|
}
,
and (
1
-
t
)
2
t
2
≤
1
/
16. From these, we can easily obtain (15).Smooth shape preserving interpolation splines are of great significance in the area of computer graphics and scientific data visualization. In the next two subsections, we will show that aC
1 shape preserving interpolation spline for positive and/or monotonic data sets can be easily constructed by constraining the shape parameters α
i in the quartic rational Hermite spline H
(
x
) given in (11).


### 3.2.C
1 Positivity-Preserving Interpolation Spline

For simplicity of presentation, let us assume a positive set of data as follows:(21)
(
x
1
,
f
1
)
,
(
x
2
,
f
2
)
,
…
,
(
x
n
,
f
n
)
,
where x
1
<
x
2
<
⋯
<
x
n, f
i
∈
R, and f
i
>
0, i
=
1,2
,
…
,
n.Without loss of generality, we just consider the splineH
(
x
) constrained on the subinterval [
x
i
,
x
i
+
1
]. Since the quartic rational Said-Ball-like basis functions B
j
(
t
;
α
i
,
α
i
+
1
)
(
j
=
0,1
,
2,3
) are nonnegative, from (11) we can see that H
(
x
)
>
0 for any x
∈
[
x
i
,
x
i
+
1
] if
(22)
f
i
+
h
i
2
+
α
i
d
i
≥
0
,
f
i
+
1
-
h
i
2
+
α
i
+
1
d
i
+
1
≥
0
.From (22), we can easily obtain the following sufficient conditions for constructing a C
1 positivity-preserving interpolation spline H
(
x
):
(23)
α
1
=
max
⁡
{
-
2
-
h
1
d
1
f
1
,
0
}
+
m
1
,
α
i
=
max
⁡
{
-
2
+
h
i
-
1
d
i
f
i
,
-
2
-
h
i
d
i
f
i
,
0
}
+
m
i
,
v
v
v
v
v
v
v
v
j
v
v
v
v
v
v
v
v
v
v
i
=
2,3
,
…
,
n
-
1
,
α
n
=
max
⁡
{
-
2
+
h
n
-
1
d
n
f
n
,
0
}
+
m
n
,
where the free parameter m
i
≥
0, i
=
1,2
,
…
,
n, can be set by users for interactively controlling the shape of the obtained spline curve.Figure6 shows our positivity-preserving interpolation spline (on the left) for the positive dataset given in Table 1 and the graphics of their first derivatives (on the right). It can be seen that the spline curves preserve the positive shape of the data well and they all achieve C
1 continuity. The visually pleasing positivity-preserving interpolation spline is generated by applying the sufficient conditions in (23) with different free shape parameters m
i. Figure 7 shows the comparison between our positivity-preserving interpolation spline curves ((on the left), with the choice of free parameters m
=
(
0,0
,
4,4
,
0,0
,
0,0
)) and the positivity-preserving interpolation spline curves given in [26] for the same positive dataset given in Table 2. From the results, it is obvious that our positivity-preserving interpolation spline curves and the scheme given in [26] can construct similar curves to describe the positive dataset.Table 1
Positive dataset given in [14].
i
1
2
3
4
5
6
7
x
i
2
3
7
8
9
13
14
f
i
10
2
3
7
2
3
10Table 2
Positive dataset given in [26].
i
1
2
3
4
5
6
7
8
x
i
1
2
3
8
10
11
12
14
f
i
14.00
8.00
2.00
0.80
0.50
0.25
0.40
0.37Positivity-preserving interpolation spline curves for the dataset given in Table1 and the graphics of their first derivatives.
(a)
(b)
(c)
(d)
(e)
(f)Comparison between our positivity-preserving interpolation spline curves (on the left) and the positivity-preserving interpolation spline curves given in [26].
(a)
(b)


### 3.3.C
1 Monotonicity-Preserving Interpolation Spline

Similarly as in the last subsection, a monotonic increasing set of data is given as follows:(24)
(
x
1
,
f
1
)
,
(
x
2
,
f
2
)
,
…
,
(
x
n
,
f
n
)
,
where x
1
<
x
2
<
⋯
<
x
n, f
i
∈
R, and f
1
<
f
2
<
⋯
<
f
n. For a monotonic increasing preserving interpolation spline H
(
x
), it is necessary that the corresponding derivative values meet
(25)
d
i
>
0
,
i
=
1,2
,
…
,
n
.
Obviously, the derivative values d
i chosen by (13) can ensure this necessary condition.Without loss of generality, we just consider the functionH
(
x
) constrained on the subinterval [
x
i
,
x
i
+
1
]. From (11), direct computation gives that
(26)
H
′
(
x
)
=
(
1
-
t
)
(
2
+
α
i
+
α
i
t
)
(
2
+
α
i
)
(
1
+
α
i
t
)
2
d
i
+
t
[
2
+
α
i
+
1
+
α
i
+
1
(
1
-
t
)
]
(
2
+
α
i
+
1
)
[
1
+
α
i
+
1
(
1
-
t
)
]
2
d
i
+
1
+
6
(
1
-
t
)
t
[
Δ
i
-
(
d
i
2
+
α
i
+
d
i
+
1
2
+
α
i
+
1
)
]
,
where Δ
i
=
(
f
i
+
1
-
f
)
i
/
h
i. From (26) we can see that H
′
(
x
)
>
0 for any x
∈
[
x
i
,
x
i
+
1
] if
(27)
Δ
i
-
(
d
i
2
+
α
i
+
d
i
+
1
2
+
α
i
+
1
)
≥
0
,
where the necessary conditions d
i
>
0,  d
i
+
1
>
0 are assumed.From (27), we can easily obtain the following sufficient conditions for constructing a C
1 monotonicity-preserving interpolation spline H
(
x
)
(28)
α
1
=
max
⁡
{
-
2
+
2
d
1
Δ
1
,
0
}
+
n
1
,
α
i
=
max
⁡
{
-
2
+
2
d
i
Δ
i
-
1
,
-
2

+

2
d
i
Δ
i
,
0
}
+
n
i
,
a
a
a
a
a
a
a
a
a
i
a
a
a
a
a
i
=
2,3
,
…
,
n

-

1
,
α
n
=
max
⁡
{
-
2
+
2
d
n
Δ
n
-
1
,
0
}
+
n
n
,
where the free parameter n
i
≥
0, i
=
1,2
,
…
,
n, can be specified by users to achieve a monotonicity-preserving interpolation spline.Similarly, we can deal with a monotonic decreasing data. It should be noted that, iff
i
+
1
=
f
i, it is necessary to set f
i
=
f
i
+
1
=
0. Thus for any α
i
,
α
i
+
1
∈
[
0
,
+
∞
), H
(
x
)
=
f
i
=
f
i
+
1, is a constant on [
x
i
,
x
i
+
1
]. For the case where the data is monotonic but not strictly monotonic (i.e., when some f
i
+
1
=
f
i) it would be necessary to divide the data into several strictly monotonic parts. And we should set d
i
=
d
i
+
1
=
0, whenever f
i
+
1
=
f
i.Figure8 shows our monotonicity-preserving interpolation spline (on the left) for the dataset in Table 3 and the graphics of their first derivatives (on the right). Obviously, all of the interpolation spline curves have the properties of monotonicity-preserving and they are all C
1 continuous. The visually pleasing monotonicity-preserving interpolation spline is generated by applying the sufficient conditions in (28) with different free shape parameters n
i. Figure 9 shows the comparison between our monotonicity-preserving interpolation spline curves (on the left, with the choice of the free parameters n
=
(
0,0
,
0,0
)) and the monotonicity-preserving interpolation spline curves given in [26] for the monotone dataset given in Table 4. From the results, it can be seen that our monotonicity-preserving interpolation spline curves describe the monotone dataset as well as the scheme given in [26].Table 3
Akima’s dataset given in [27].
i
1
2
3
4
5
6
7
8
9
10
11
x
i
0
2
3
5
6
8
9
11
12
14
15
f
i
10
10
10
10
10
10
10.5
15
50
60
85Table 4
The monotone dataset given in [26].
i
1
2
3
4
x
i
0.0
0.5
2.2
3.3
f
i
124
331
379
835Monotonicity-preserving interpolation spline curves for the Akima’s data given in Table3 and the graphics of their first derivatives.
(a)
(b)
(c)
(d)
(e)
(f)Comparison between our monotonicity-preserving interpolation spline curves (on the left) and the monotonicity-preserving interpolation spline curves given in [26].
(a)
(b)


## 3.1.C
1 Quartic Rational Hermite Interpolation Spline and Convergence Analysis

Letf
i
∈
R, i
=
1
,
…
,
n, be data given at the distinct knots x
i
∈
R, i
=
1
,
…
,
n, with interval spacing h
i
=
x
i
+
1
-
x
i
>
0, and let d
i
∈
R denote the first derivative values defined at the knots. By using the basis given in (1), we construct a quartic rational Hermite interpolation spline H
:
R
→
R as follows:
(11)
H
(
x
)
|
[
x
i
,
x
i
+
1
]
=
B
0
(
t
;
α
i
)
f
i
+
B
1
(
t
;
α
i
)
(
f
i
+
h
i
2
+
α
i
d
i
)
+
B
2
(
t
;
α
i
+
1
)
(
f
i
+
1
-
h
i
2
+
α
i
+
1
d
i
+
1
)
+
B
3
(
t
;
α
i
+
1
)
f
i
+
1
,
where t
=
(
x
-
x
i
)
/
h
i, α
i
,
α
i
+
1
∈
[
0
,
+
∞
),  i
=
1,2
,
…
,
n
-
1.The spline given in (11) is a C
1 Hermite interpolation spline as it satisfies the following interpolatory properties:
(12)
H
(
x
i
)
=
f
i
,
H
(
x
i
+
1
)
=
f
i
+
1
,
H
′
(
x
i
)
=
d
i
,
H
′
(
x
i
+
1
)
=
d
i
+
1
.
And it can be easily checked that, for α
i
=
α
i
+
1
=
0, the quartic rational Hermite interpolation spline is exactly the classical cubic Hermite interpolation spline.Here, all tangent informationd
i is computed from the given data (
x
i
,
f
i
), i
=
1,2
,
…
,
n, as follows:
(13)
d
1
=
f
2
-
f
1
h
1
,
d
i
=
1
h
i
-
1
+
h
i
[
h
i
f
i
-
f
i
-
1
h
i
-
1
+
h
i
-
1
f
i
+
1
-
f
i
h
i
]
,
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
i
=
2,3
,
…
,
n
-
1
,
d
n
=
f
n
-
f
n
-
1
h
n
-
1
,
which is used usually for generating Hermite interpolation curves.In practical applications, the corner cutting algorithm given in (9) can be used to compute the quartic rational Hermite interpolation spline H
(
x
) effectively and stably. From (11), it is obvious that the shape parameter α
i only affects two associated curve segments. As α
i increases, the curve H
(
x
) is pulled towards the point H
(
x
i
) in the neighborhood of the knot position x
i. In other words, the shape parameter α
i serves as a local tension shape parameter.Next, we will make a convergence analysis on the quartic rational Hermite interpolation splineH
(
x
). Let f
(
x
) be a given function to which H
(
x
) is compared. For i
=
1,2
,
…
,
n, we denote f
i
=
f
(
x
i
), f
i
′
=
f
′
(
x
i
) and write
(14)
∥
f
(
4
)
∥
i
,
i
+
1
=
max
⁡
x
i
≤
x
≤
x
i
+
2
|
f
(
4
)
(
x
)
|
,
Δ
i
=
f
i
+
1
-
f
i
h
i
.Theorem 4.
Letf
∈
C
4
[
a
,
b
], for x
∈
[
x
i
,
x
i
+
1
]
,
α
i
,
α
i
+
1
∈
[
0
,
+
∞
)
i
=
1,2
,
…
,
n
-
1; and we have
(15)
|
f
(
x
)
-
H
(
x
)
|
≤
h
i
4
384
∥
f
(
4
)
∥
i
,
i
+
1
+
h
i
4
max
⁡
{
|
f
i
′
-
d
i
|
,
|
f
i
+
1
′
-
d
i
+
1
|
}
+
h
i
8
max
⁡
{
α
i
2
|
d
i
|
2
+
α
i
,
α
i
+
1
2
|
d
i
+
1
|
2
+
α
i
+
1
}
.Proof.
Forx
∈
[
x
i
,
x
i
+
1
], i
=
1,2
,
…
,
n
-
1, let t
=
(
x
-
x
i
)
/
h
i and
(16)
H
3
(
x
)
=
(
1
-
t
)
f
i
+
t
f
i
+
1
-
h
i
(
1
-
t
)
t
×
[
(
1
-
t
)
(
Δ
i
-
d
i
)
+
t
(
d
i
+
1
-
Δ
i
)
]
.
After some computations, we have
(17)
H
(
x
)
=
H
3
(
x
)
+
[
α
i
+
1
2
d
i
+
1
(
2
+
α
i
+
1
)
[
1
+
α
i
+
1
(
1
-
t
)
]
-
α
i
2
d
i
(
2
+
α
i
)
[
1
+
α
i
t
]
]
(
1
-
t
)
2
t
2
h
i
.
With the notationf
i
′
=
f
′
(
x
i
), i
=
1,2
,
…
,
n, let
(18)
H
3
*
(
x
)
=
(
1
-
t
)
f
i
+
t
f
i
+
1
-
h
i
(
1
-
t
)
t
×
[
(
1
-
t
)
(
Δ
i
-
f
i
′
)
+
t
(
f
i
+
1
′
-
Δ
i
)
]
.
SinceH
3
*
(
x
) is the cubic Hermite interpolant to f
(
x
), we have
(19)
|
f
(
x
)
-
H
3
*
(
x
)
|
≤
h
i
4
384
∥
f
(
4
)
∥
i
,
i
+
1
.
It is easy to see that
(20)
|
H
(
x
)
-
H
3
*
(
x
)
|
≤
h
i
4
max
⁡
{
|
f
i
′
-
d
i
|
,
|
f
i
+
1
′
-
d
i
+
1
|
}
,
and (
1
-
t
)
2
t
2
≤
1
/
16. From these, we can easily obtain (15).Smooth shape preserving interpolation splines are of great significance in the area of computer graphics and scientific data visualization. In the next two subsections, we will show that aC
1 shape preserving interpolation spline for positive and/or monotonic data sets can be easily constructed by constraining the shape parameters α
i in the quartic rational Hermite spline H
(
x
) given in (11).


## 3.2.C
1 Positivity-Preserving Interpolation Spline

For simplicity of presentation, let us assume a positive set of data as follows:(21)
(
x
1
,
f
1
)
,
(
x
2
,
f
2
)
,
…
,
(
x
n
,
f
n
)
,
where x
1
<
x
2
<
⋯
<
x
n, f
i
∈
R, and f
i
>
0, i
=
1,2
,
…
,
n.Without loss of generality, we just consider the splineH
(
x
) constrained on the subinterval [
x
i
,
x
i
+
1
]. Since the quartic rational Said-Ball-like basis functions B
j
(
t
;
α
i
,
α
i
+
1
)
(
j
=
0,1
,
2,3
) are nonnegative, from (11) we can see that H
(
x
)
>
0 for any x
∈
[
x
i
,
x
i
+
1
] if
(22)
f
i
+
h
i
2
+
α
i
d
i
≥
0
,
f
i
+
1
-
h
i
2
+
α
i
+
1
d
i
+
1
≥
0
.From (22), we can easily obtain the following sufficient conditions for constructing a C
1 positivity-preserving interpolation spline H
(
x
):
(23)
α
1
=
max
⁡
{
-
2
-
h
1
d
1
f
1
,
0
}
+
m
1
,
α
i
=
max
⁡
{
-
2
+
h
i
-
1
d
i
f
i
,
-
2
-
h
i
d
i
f
i
,
0
}
+
m
i
,
v
v
v
v
v
v
v
v
j
v
v
v
v
v
v
v
v
v
v
i
=
2,3
,
…
,
n
-
1
,
α
n
=
max
⁡
{
-
2
+
h
n
-
1
d
n
f
n
,
0
}
+
m
n
,
where the free parameter m
i
≥
0, i
=
1,2
,
…
,
n, can be set by users for interactively controlling the shape of the obtained spline curve.Figure6 shows our positivity-preserving interpolation spline (on the left) for the positive dataset given in Table 1 and the graphics of their first derivatives (on the right). It can be seen that the spline curves preserve the positive shape of the data well and they all achieve C
1 continuity. The visually pleasing positivity-preserving interpolation spline is generated by applying the sufficient conditions in (23) with different free shape parameters m
i. Figure 7 shows the comparison between our positivity-preserving interpolation spline curves ((on the left), with the choice of free parameters m
=
(
0,0
,
4,4
,
0,0
,
0,0
)) and the positivity-preserving interpolation spline curves given in [26] for the same positive dataset given in Table 2. From the results, it is obvious that our positivity-preserving interpolation spline curves and the scheme given in [26] can construct similar curves to describe the positive dataset.Table 1
Positive dataset given in [14].
i
1
2
3
4
5
6
7
x
i
2
3
7
8
9
13
14
f
i
10
2
3
7
2
3
10Table 2
Positive dataset given in [26].
i
1
2
3
4
5
6
7
8
x
i
1
2
3
8
10
11
12
14
f
i
14.00
8.00
2.00
0.80
0.50
0.25
0.40
0.37Positivity-preserving interpolation spline curves for the dataset given in Table1 and the graphics of their first derivatives.
(a)
(b)
(c)
(d)
(e)
(f)Comparison between our positivity-preserving interpolation spline curves (on the left) and the positivity-preserving interpolation spline curves given in [26].
(a)
(b)


## 3.3.C
1 Monotonicity-Preserving Interpolation Spline

Similarly as in the last subsection, a monotonic increasing set of data is given as follows:(24)
(
x
1
,
f
1
)
,
(
x
2
,
f
2
)
,
…
,
(
x
n
,
f
n
)
,
where x
1
<
x
2
<
⋯
<
x
n, f
i
∈
R, and f
1
<
f
2
<
⋯
<
f
n. For a monotonic increasing preserving interpolation spline H
(
x
), it is necessary that the corresponding derivative values meet
(25)
d
i
>
0
,
i
=
1,2
,
…
,
n
.
Obviously, the derivative values d
i chosen by (13) can ensure this necessary condition.Without loss of generality, we just consider the functionH
(
x
) constrained on the subinterval [
x
i
,
x
i
+
1
]. From (11), direct computation gives that
(26)
H
′
(
x
)
=
(
1
-
t
)
(
2
+
α
i
+
α
i
t
)
(
2
+
α
i
)
(
1
+
α
i
t
)
2
d
i
+
t
[
2
+
α
i
+
1
+
α
i
+
1
(
1
-
t
)
]
(
2
+
α
i
+
1
)
[
1
+
α
i
+
1
(
1
-
t
)
]
2
d
i
+
1
+
6
(
1
-
t
)
t
[
Δ
i
-
(
d
i
2
+
α
i
+
d
i
+
1
2
+
α
i
+
1
)
]
,
where Δ
i
=
(
f
i
+
1
-
f
)
i
/
h
i. From (26) we can see that H
′
(
x
)
>
0 for any x
∈
[
x
i
,
x
i
+
1
] if
(27)
Δ
i
-
(
d
i
2
+
α
i
+
d
i
+
1
2
+
α
i
+
1
)
≥
0
,
where the necessary conditions d
i
>
0,  d
i
+
1
>
0 are assumed.From (27), we can easily obtain the following sufficient conditions for constructing a C
1 monotonicity-preserving interpolation spline H
(
x
)
(28)
α
1
=
max
⁡
{
-
2
+
2
d
1
Δ
1
,
0
}
+
n
1
,
α
i
=
max
⁡
{
-
2
+
2
d
i
Δ
i
-
1
,
-
2

+

2
d
i
Δ
i
,
0
}
+
n
i
,
a
a
a
a
a
a
a
a
a
i
a
a
a
a
a
i
=
2,3
,
…
,
n

-

1
,
α
n
=
max
⁡
{
-
2
+
2
d
n
Δ
n
-
1
,
0
}
+
n
n
,
where the free parameter n
i
≥
0, i
=
1,2
,
…
,
n, can be specified by users to achieve a monotonicity-preserving interpolation spline.Similarly, we can deal with a monotonic decreasing data. It should be noted that, iff
i
+
1
=
f
i, it is necessary to set f
i
=
f
i
+
1
=
0. Thus for any α
i
,
α
i
+
1
∈
[
0
,
+
∞
), H
(
x
)
=
f
i
=
f
i
+
1, is a constant on [
x
i
,
x
i
+
1
]. For the case where the data is monotonic but not strictly monotonic (i.e., when some f
i
+
1
=
f
i) it would be necessary to divide the data into several strictly monotonic parts. And we should set d
i
=
d
i
+
1
=
0, whenever f
i
+
1
=
f
i.Figure8 shows our monotonicity-preserving interpolation spline (on the left) for the dataset in Table 3 and the graphics of their first derivatives (on the right). Obviously, all of the interpolation spline curves have the properties of monotonicity-preserving and they are all C
1 continuous. The visually pleasing monotonicity-preserving interpolation spline is generated by applying the sufficient conditions in (28) with different free shape parameters n
i. Figure 9 shows the comparison between our monotonicity-preserving interpolation spline curves (on the left, with the choice of the free parameters n
=
(
0,0
,
0,0
)) and the monotonicity-preserving interpolation spline curves given in [26] for the monotone dataset given in Table 4. From the results, it can be seen that our monotonicity-preserving interpolation spline curves describe the monotone dataset as well as the scheme given in [26].Table 3
Akima’s dataset given in [27].
i
1
2
3
4
5
6
7
8
9
10
11
x
i
0
2
3
5
6
8
9
11
12
14
15
f
i
10
10
10
10
10
10
10.5
15
50
60
85Table 4
The monotone dataset given in [26].
i
1
2
3
4
x
i
0.0
0.5
2.2
3.3
f
i
124
331
379
835Monotonicity-preserving interpolation spline curves for the Akima’s data given in Table3 and the graphics of their first derivatives.
(a)
(b)
(c)
(d)
(e)
(f)Comparison between our monotonicity-preserving interpolation spline curves (on the left) and the monotonicity-preserving interpolation spline curves given in [26].
(a)
(b)


## 4. Quartic Rational Said-Ball-Like Basis over a Triangular Domain

Based on the proposed quartic rational Said-Ball-like basis with two shape parameters given in (1), by using the method of tensor product, we can easily construct a kind of biquartic rational Said-Ball-like patch over a rectangle domain with four shape parameters. However, the patch over the triangular domain is not a tensor product patch exactly. These imply that we cannot extend the basis (1) to a triangular domain by using the method of tensor product. In this section, we will construct a new class of quartic rational Said-Ball-like basis over a triangular domain with three shape parameters, which is an extension over a triangular domain of the basis (1).


### 4.1. Construction and Properties of the Basis

Here, we give the definition of the new quartic rational Said-Ball-like basis functions over a triangular domain as follows.Definition 5.
Letα
,
β
,
γ
∈
[
0
,
+
∞
), and D
∶
=
{
(
t
,
s
,
w
)
∣
t
+
s
+
w
=
1
,
t
≥
0
,
s
≥
0
,
w
≥
0
}; the following ten functions are defined as new quartic rational Said-Ball-like basis functions, with three shape parameters α, β, and γ, over the triangular domain D:
(29)
B
3,0
,
0
3
(
t
,
s
,
w
)
=
t
2
1
+
α
(
1
-
t
)
,
B
0,3
,
0
3
(
t
,
s
,
w
)
=
s
2
1
+
β
(
1
-
s
)
,
B
0,0
,
3
3
(
t
,
s
,
w
)
=
w
2
1
+
γ
(
1
-
w
)
,
B
2,1
,
0
3
(
t
,
s
,
w
)
=
t
2
s
[
2
+
α
+
2
α
(
1
-
t
)
]
1
+
α
(
1
-
t
)
,
B
2,0
,
1
3
(
t
,
s
,
w
)
=
t
2
w
[
2
+
α
+
2
α
(
1
-
t
)
]
1
+
α
(
1
-
t
)
,
B
1,2
,
0
3
(
t
,
s
,
w
)
=
t
s
2
[
2
+
β
+
2
β
(
1
-
s
)
]
1
+
β
(
1
-
s
)
,
B
0,2
,
1
3
(
t
,
s
,
w
)
=
s
2
w
[
2
+
β
+
2
β
(
1
-
s
)
]
1
+
β
(
1
-
s
)
,
B
1,0
,
2
3
(
t
,
s
,
w
)
=
t
w
2
[
2
+
γ
+
2
γ
(
1
-
w
)
]
1
+
γ
(
1
-
w
)
,
B
0,1
,
2
3
(
t
,
s
,
w
)
=
s
w
2
[
2
+
γ
+
2
γ
(
1
-
w
)
]
1
+
γ
(
1
-
w
)
,
B
1,1
,
1
3
(
t
,
s
,
w
)
=
1
-
∑
i
+
j
+
k
=
3
,
i
·
j
·
k
≠
1
‍
B
i
,
j
,
k
3
(
t
,
s
,
w
)
.Remark 6.
In the following discussion, we will denote the new quartic rational Said-Ball-like basis functions asB
i
,
j
,
k
3
(
t
,
s
,
w
;
α
,
β
,
γ
), i
,
j
,
k
∈
N, i
+
j
+
k
=
3. It is easy to check that for α
=
β
=
γ
=
0, the basis functions given in (29) are precisely the cubic Said-Ball basis functions over a triangular domain; see [8].From the expressions of the new quartic rational Said-Ball-like basis functions over a triangular domain given in (29), we can obtain the following important properties of the new basis.Theorem 7.
The basis functions over a triangular domain given in (29) have the following properties. (a)
Partition of unity:∑
i
+
j
+
k
=
3
‍
B
i
,
j
,
k
3
(
t
,
s
,
w
)
=
1.
(b)
Nonnegativity:B
i
,
j
,
k
3
(
t
,
s
,
w
)
≥
0,  i
,
j
,
k
∈
N, i
+
j
+
k
=
3.
(c)
Property at the corner points: fori
,
j
,
k
∈
N, i
+
j
+
k
=
3, we have
(30)
B
i
,
j
,
k
3
(
1,0
,
0
)
=
{
1
,
i
=
3
,
0
,
i
≠
3
,
B
i
,
j
,
k
3
(
0,1
,
0
)
=
{
1
,
j
=
3
,
0
,
j
≠
3
,
B
i
,
j
,
k
3
(
0,0
,
1
)
=
{
1
,
k
=
3
,
0
,
k
≠
3
.
(d)
Derivative at the corner points: fort
,
s
,
1
-
t
-
s
≥
0, i
,
j
,
k
∈
N, and i
+
j
+
k
=
3, we have
(31)
∂
B
i
,
j
,
k
3
(
t
,
s
,
1
-
t
-
s
)
∂
t
|
(
1,0
,
0
)
=
{
2
+
α
,
(
i
,
j
,
k
)
=
(
3,0
,
0
)
,
-
2
-
α
,
(
i
,
j
,
k
)
=
(
2,0
,
1
)
,
0
,
o
t
h
e
r
,
∂
B
i
,
j
,
k
3
(
t
,
s
,
1
-
t
-
s
)
∂
s
|
(
1,0
,
0
)
=
{
2
+
α
,
(
i
,
j
,
k
)
=
(
2,1
,
0
)
,
-
2
-
α
,
(
i
,
j
,
k
)
=
(
2,0
,
1
)
,
0
,
o
t
h
e
r
,
∂
B
i
,
j
,
k
3
(
t
,
s
,
1
-
t
-
s
)
∂
t
|
(
0,1
,
0
)
=
{
2
+
β
,
(
i
,
j
,
k
)
=
(
1,2
,
0
)
,
-
2
-
β
,
(
i
,
j
,
k
)
=
(
0,2
,
1
)
,
0
,
o
t
h
e
r
,
∂
B
i
,
j
,
k
3
(
t
,
s
,
1
-
t
-
s
)
∂
s
|
(
0,1
,
0
)
=
{
2
+
β
,
(
i
,
j
,
k
)
=
(
0,3
,
0
)
,
-
2
-
β
,
(
i
,
j
,
k
)
=
(
0,2
,
1
)
,
0
,
o
t
h
e
r
,
∂
B
i
,
j
,
k
3
(
t
,
s
,
1
-
t
-
s
)
∂
t
|
(
0,0
,
1
)
=
{
2
+
γ
,
(
i
,
j
,
k
)
=
(
1,0
,
2
)
,
-
2
-
γ
,
(
i
,
j
,
k
)
=
(
0,0
,
3
)
,
0
,
o
t
h
e
r
,
∂
B
i
,
j
,
k
3
(
t
,
s
,
1
-
t
-
s
)
∂
s
|
(
0,0
,
1
)
=
{
2
+
γ
,
(
i
,
j
,
k
)
=
(
0,1
,
2
)
,
-
2
-
γ
,
(
i
,
j
,
k
)
=
(
0,0
,
3
)
,
0
,
o
t
h
e
r
.
(e)
Boundary property: when one of the three variablesw is taken as zero, the ten quartic rational basis functions B
i
,
j
,
k
3
(
t
,
s
,
w
) degenerate to the corresponding quartic rational Said-Ball-like basis functions B
i
(
t
;
β
,
α
) (notice s
=
1
-
t) given in (1).
(f)
Linear independence:{
B
i
,
j
,
k
3
(
t
,
s
,
w
)
,
j
+
j
+
k
=
3
} are linearly independent.Proof.
We will prove(
b
) and (
f
). Simple and direct computation can give out the remaining properties.(b)
For anyα
,
β
,
γ
∈
[
0
,
+
∞
), i
,
j
,
k
∈
N,  i
+
j
+
k
=
3, and i
·
j
·
k
≠
1, B
i
,
j
,
k
3
(
t
,
s
,
w
)
≥
0 is obvious. Furthermore, for B
1,1
,
1
3
(
t
,
s
,
w
), by directly computing, we have
(32)
B
1,1
,
1
3
(
t
,
s
,
w
)
=
1
-
∑
i
+
j
+
k
=
3
,
i
·
j
·
k
≠
1
‍
B
i
,
j
,
k
3
(
t
,
s
,
w
)
=
1
-
[
3
(
t
2
+
s
2
+
w
2
)
-
2
(
t
3
+
s
3
+
w
3
)
]
=
6
t
s
w
≥
0
.
(f)
Forα
,
β
,
γ
∈
[
0
,
+
∞
), ξ
i
,
j
,
k
∈
R
(
i
+
j
+
k
=
3
), we consider a linear combination
(33)
∑
i
+
j
+
k
=
3
‍
ξ
i
,
j
,
k
B
i
,
j
,
k
3
(
t
,
s
,
w
)
=
0
.
Letw
=
0; we have
(34)
∑
i
=
0
3
‍
ξ
i
,
3
-
i
,
0
B
i
(
t
;
β
,
α
)
=
0
.
Differentiating with respect to the variablet on both sides, we have
(35)
∑
i
=
0
3
‍
ξ
i
,
3
-
i
,
0
B
i
′
(
t
;
β
,
α
)
=
0
.
Fort
=
0, from (34) and (35), we get
(36)
ξ
0,3
,
0
=
0
,
(
2
+
β
)
(
ξ
1,2
,
0
-
ξ
0,3
,
0
)
=
0
.
Thus, we haveξ
0,3
,
0
=
ξ
1,2
,
0
=
0. And for t
=
1, from (34) and (35), we can also obtain ξ
3,0
,
0
=
ξ
2,1
,
0
=
0. Similarly, ξ
i
,
0,3
-
i
=
ξ
0
,
i
,
3
-
i
=
0, i
=
0,1
,
2,3. And finally, ξ
1,1
,
1
=
0.
These imply the theorem.Figure10 shows some plots of quartic rational Said-Ball-like basis functions over a triangular domain. The three shape parameters take values α
=
0, β
=
1, γ
=
2.Some plots of quartic rational Said-Ball-like basis functions over a triangular domain.
(a)
(b)
(c)
(d)


### 4.2. Definition and Properties of the Quartic Rational Triangular Said-Ball-Like Patch

Definition 8.
Letα
,
β
,
γ
∈
[
0
,
+
∞
), given control points P
i
j
k
∈
R
3
(
i
,
j
,
k
∈
N
,
i
+
j
+
k
=
3
) and a triangular domain D
=
{
(
t
,
s
,
w
)
∣
t
+
s
+
w
=
1
,
t
≥
0
,
s
≥
0
,
w
≥
0
}. We call
(37)
R
(
t
,
s
,
w
)
=
∑
i
+
j
+
k
=
3
‍
B
i
,
j
,
k
3
(
t
,
s
,
w
)
P
i
,
j
,
k
,
(
t
,
s
,
w
)
∈
D
the quartic rational triangular Said-Ball-like patch with three shape parameters α
,
β
,
γ.From the properties of the quartic rational Said-Ball-like basis functions over a triangular domain, some properties of the quartic rational triangular Said-Ball-liek patch (37) can be obtained easily as follows.(a)
Affine invariance and convex hull properties: since the basis functions (29) have the properties of partition of unity and nonnegativity, we can see that the corresponding patch (37) has affine invariance and convex hull property.
(b)
Geometric properties at the corner points: direct computation gives that(38)
R
(
1,0
,
0
)
=
P
3,0
,
0
,
R
(
0,1
,
0
)
=
P
0,3
,
0
,
R
(
0,0
,
1
)
=
P
0,0
,
3
.
These indicate that the patch (37) interpolates at the corner points.
(c)
Tangent planes at the corner points: letw
=
1
-
s
-
t; we have
(39)
∂
R
(
t
,
s
,
w
)
∂
t
|
(
1,0
,
0
)
=
(
2
+
α
)
(
P
3,0
,
0
-
P
2,0
,
1
)
,
∂
R
(
t
,
s
,
w
)
∂
s
|
(
1,0
,
0
)
=
(
2
+
α
)
(
P
2,1
,
0
-
P
2,0
,
1
)
,
∂
R
(
t
,
s
,
w
)
∂
t
|
(
0,1
,
0
)
=
(
2
+
β
)
(
P
1,2
,
0
-
P
0,2
,
1
)
,
∂
R
(
t
,
s
,
w
)
∂
s
|
(
0,1
,
0
)
=
(
2
+
β
)
(
P
0,3
,
0
-
P
0,2
,
1
)
,
∂
R
(
t
,
s
,
w
)
∂
t
|
(
0,0
,
1
)
=
(
2
+
γ
)
(
P
1,0
,
2
-
P
0,0
,
3
)
,
∂
R
(
t
,
s
,
w
)
∂
s
|
(
0,0
,
1
)
=
(
2
+
γ
)
(
P
0,1
,
2
-
P
0,0
,
3
)
.
These indicate that the tangent planes at the three corner points (
1,0
,
0
), (
0,1
,
0
), and (
0,0
,
1
) are the three planes spanned by the control points P
3,0
,
0, P
2,1
,
0, and P
2,0
,
1; P
0,3
,
0, P
1,2
,
0, and P
0,2
,
1; and
P
0,0
,
3, P
1,0
,
2,  and  P
0,1
,
2, respectively.
(d)
Boundary property: forw
=
0, R
(
t
,
s
,
w
) is a quartic rational Said-Ball-like curve with two shape parameters α and β. And similarly, R
(
0
,
s
,
w
) and R
(
t
,
0
,
w
) both are quartic rational Said-Ball-like curves with shape parameters β, γ and α, γ, respectively.
(e)
Shape adjustable property: without changing the control net, we can adjust the shape of the quartic rational triangular Said-Ball-like patch conveniently by using the three shape parametersα, β, and γ. As the three shape parameters increase at the same time, the patch will be made close to the control net. Thus the three shape parameters α, β, γ serve as tension parameters. Furthermore, from the boundary property of the patch, we can see that the three shape parameters α, β, and γ have nothing to do with the boundary curves R
(
0
,
s
,
w
), R
(
t
,
0
,
w
), and R
(
t
,
s
,
0
), respectively. These imply that altering the value of a single shape parameter, one corresponding boundary curve of the generated patch will not change.Figure11 shows the quartic rational triangular patches and the effect on the patches by altering the values of the shape parameters without changing the control points.Quartic rational triangular Said-Ball-like patches with different shape parameters.
(a)
(b)
(c)
(d)
(e)
(f)


### 4.3. De Casteljau-Type Algorithm

The classical de Casteljau algorithm is a stable and efficient process for computing the triangular Bernstein-Bézier patch. Here, we will develop a de Casteljau-type algorithm for computing the proposed quartic rational triangular Said-Ball-like patch. By setting(40)
P
2,0
,
0
1
∶
=
1
1
+
α
(
1
-
t
)
P
3,0
,
0
+
α
s
1
+
α
(
1
-
t
)
P
2,1
,
0
+
α
w
1
+
α
(
1
-
t
)
P
2,0
,
1
,
P
1,1
,
0
1
∶
=
t
P
2,1
,
0
+
s
P
1,2
,
0
+
w
P
1,1
,
1
,
P
1,0
,
1
1
∶
=
t
P
2,0
,
1
+
s
P
1,1
,
1
+
w
P
1,0
,
2
,
P
1,1
,
0
1
∶
=
t
P
2,1
,
0
+
s
P
1,2
,
0
+
w
P
1,1
,
1
,
P
0,2
,
0
1
∶
=
β
t
1
+
β
(
1
-
s
)
P
1,2
,
0
+
1
1
+
β
(
1
-
s
)
P
0,3
,
0
+
β
w
1
+
β
(
1
-
s
)
P
0,2
,
1
,
P
0,1
,
1
1
∶
=
t
P
1,1
,
1
+
s
P
0,2
,
1
+
w
P
0,1
,
2
,
P
1,0
,
1
1
∶
=
t
P
2,0
,
1
+
s
P
1,1
,
1
+
w
P
1,0
,
2
,
P
0,1
,
1
1
∶
=
t
P
1,1
,
1
+
s
P
0,2
,
1
+
w
P
0,1
,
2
,
P
0,0
,
2
1
∶
=
γ
t
1
+
γ
(
1
-
w
)
P
1,0
,
2
+
γ
s
1
+
γ
(
1
-
w
)
P
0,1
,
2
+
1
1
+
γ
(
1
-
w
)
P
0,0
,
3
,
we have
(41)
R
(
t
,
s
,
w
)
=
t
(
t
P
2,0
,
0
1
+
s
P
1,1
,
0
1
+
w
P
1,0
,
1
1
)
+
s
(
t
P
1,1
,
0
1
+
s
P
0,2
,
0
1
+
w
P
0,1
,
1
1
)
+
w
(
t
P
1,0
,
1
1
+
s
P
0,1
,
1
1
+
w
P
0,0
,
2
1
)
.
Furthermore, there are three points at the second level:
(42)
P
1,0
,
0
2
∶
=
t
P
2,0
,
0
1
+
s
P
1,1
,
0
1
+
w
P
1,0
,
1
1
,
P
0,1
,
0
2
∶
=
t
P
1,1
,
0
1
+
s
P
0,2
,
0
1
+
w
P
0,1
,
1
1
,
P
0,0
,
1
2
∶
=
t
P
1,0
,
1
1
+
s
P
0,1
,
1
1
+
w
P
0,0
,
2
1
,
which lead to
(43)
R
(
t
,
s
,
w
)
=
t
P
1,0
,
0
2
+
s
P
0,1
,
0
2
+
w
P
0,0
,
1
2
:
=
P
0,0
,
0
3
.
From (41) and (43), we can immediately obtain the following de Casteljau-type algorithm:
(44)
P
i
,
j
,
k
m
=
f
i
+
1
,
j
,
k
m
-
1
(
t
,
s
,
w
)
P
i
+
1
,
j
,
k
m
-
1
+
g
i
,
j
+
1
,
k
m
-
1
(
t
,
s
,
w
)
×
P
i
,
j
+
1
,
k
m
-
1
+
h
i
,
j
,
k
+
1
m
-
1
(
t
,
s
,
w
)
P
i
,
j
,
k
+
1
m
-
1
,
where m
=
1,2
,
3, i
+
j
+
k
=
3
-
m, i
,
j
,
k
≥
0, P
i
,
j
,
k
0
=
P
i
,
j
,
k and
(45)
f
i
+
1
,
j
,
k
m
-
1
(
t
,
s
,
w
)
=
{
1
1
+
α
(
1
-
t
)
,
(
m
,
i
,
j
,
k
)
=
(
1,2
,
0,0
)
,
β
t
1
+
β
(
1
-
s
)
,
(
m
,
i
,
j
,
k
)
=
(
1,0
,
2,0
)
,
γ
t
1
+
γ
(
1
-
w
)
,
(
m
,
i
,
j
,
k
)
=
(
1,0
,
0,2
)
,
t
,
other
,
g
i
,
j
+
1
,
k
m
-
1
(
t
,
s
,
w
)
=
{
α
s
1
+
α
(
1
-
t
)
,
(
m
,
i
,
j
,
k
)
=
(
1,2
,
0,0
)
,
1
1
+
β
(
1
-
s
)
,
(
m
,
i
,
j
,
k
)
=
(
1,0
,
2,0
)
,
γ
s
1
+
γ
(
1
-
w
)
,
(
m
,
i
,
j
,
k
)
=
(
1,0
,
0,2
)
,
s
,
other
,
h
i
,
j
,
k
+
1
m
-
1
(
t
,
s
,
w
)
=
{
α
w
1
+
α
(
1
-
t
)
,
(
m
,
i
,
j
,
k
)
=
(
1,2
,
0,0
)
,
β
w
1
+
β
(
1
-
s
)
,
(
m
,
i
,
j
,
k
)
=
(
1,0
,
2,0
)
,
1
1
+
γ
(
1
-
w
)
,
(
m
,
i
,
j
,
k
)
=
(
1,0
,
0,2
)
,
w
,
other
.


### 4.4. Joining Two Patches

In practical surface construction, we often need to join several patches together in order to generate shapes that are too complex to handle with a single patch. During the joining of quartic rational triangular Said-Ball-like patches, we need to control the smoothness of the connecting surface. For(
t
,
s
,
w
)
∈
D, let two quartic rational triangular Said-Ball-like patches be defined as
(46)
R
1
(
t
,
s
,
w
)
=
∑
i
+
j
+
k
=
3
‍
B
i
,
j
,
k
3
(
t
,
s
,
w
;
α
1
,
β
,
γ
)
P
i
,
j
,
k
,
(47)
R
2
(
t
,
s
,
w
)
=
∑
i
+
j
+
k
=
3
‍
B
i
,
j
,
k
3
(
t
,
s
,
w
;
α
2
,
β
,
γ
)
Q
i
,
j
,
k
.
It is apparent that if the control points satisfy
(48)
P
0
,
j
,
k
=
Q
0
,
j
,
k
,
j
,
k
∈
N
,
j
+
k
=
3
,
the two patches will join along a common boundary curve: R
1
(
0
,
s
,
w
)
=
R
2
(
0
,
s
,
w
), s
+
w
=
1. Thus the two patches clearly form a surface with positional continuity or a surface with C
0 continuity.For the common boundary curveR
1
(
0
,
s
,
1
-
s
), differentiating with respect to s, we have
(49)
d
R
1
(
0
,
s
,
1
-
s
)
d
s
=
s
[
2
+
β
+
β
(
1
-
s
)
]
[
1
+
β
(
1
-
s
)
]
2
(
P
0,3
,
0
-
P
0,2
,
1
)
+
6
s
(
1
-
s
)
(
P
0,2
,
1
-
P
0,1
,
2
)
+
(
1
-
s
)
[
2
+
γ
+
γ
s
]
[
1
+
γ
s
]
2
(
P
0,1
,
2
-
P
0,0
,
3
)
.ForR
1
(
t
,
s
,
1
-
t
-
s
) and R
2
(
t
,
s
,
1
-
t
-
s
), we do differentiate with respect to t
(50)
∂
R
1
(
t
,
s
,
1
-
t
-
s
)
∂
t
|
t
=
0
=
s
[
2
+
β
+
β
(
1
-
s
)
]
[
1
+
β
(
1
-
s
)
]
2
(
P
1,2
,
0
-
P
0,2
,
1
)
+
6
s
(
1
-
s
)
(
P
1,1
,
1
-
P
0,1
,
2
)
+
(
1
-
s
)
[
2
+
γ
+
γ
s
]
[
1
+
γ
s
]
2
(
P
1,0
,
2
-
P
0,0
,
3
)
,
(51)
∂
R
2
(
t
,
s
,
1
-
t
-
s
)
∂
t
|
t
=
0
=
s
[
2
+
β
+
β
(
1
-
s
)
]
[
1
+
β
(
1
-
s
)
]
2
(
Q
1,2
,
0
-
Q
0,2
,
1
)
+
6
s
(
1
-
s
)
(
Q
1,1
,
1
-
Q
0,1
,
2
)
+
(
1
-
s
)
[
2
+
γ
+
γ
s
]
[
1
+
γ
s
]
2
(
Q
1,0
,
2
-
Q
0,0
,
3
)
.The condition for smooth joining is that the vectors defined by (49), (50), and (51) should be coplanar for any s
∈
[
0,1
]; see [28]. It can be expressed as
(52)
∂
R
2
(
t
,
s
,
1
-
t
-
s
)
∂
t
|
t
=
0
=
ξ
d
R
1
(
0
,
s
,
1
-
s
)
d
s
+
ζ
∂
R
1
(
t
,
s
,
1
-
t
-
s
)
∂
t
|
t
=
0
,
where both ξ and ζ are constants. From these discussions, we can easily obtain a rule:
(53)
Q
1,2
,
0
-
Q
0,2
,
1
=
ξ
(
P
0,3
,
0
-
P
0,2
,
1
)
+
ζ
(
P
1,2
,
0
-
P
0,2
,
1
)
,
Q
1,1
,
1
-
Q
0,1
,
2
=
ξ
(
P
0,2
,
1
-
P
0,1
,
2
)
+
ζ
(
P
1,1
,
1
-
P
0,1
,
2
)
,
Q
1,0
,
2
-
Q
0,0
,
3
=
ξ
(
P
0,1
,
2
-
P
0,0
,
3
)
+
ζ
(
P
1,0
,
2
-
P
0,0
,
3
)
.In summary, we conclude the following theorem.Theorem 9.
Forα
l
,
β
,
γ
∈
[
0
,
+
∞
), l
=
1,2, the surface connecting (46) with (47) is G
1 continuous, on the condition that (48) and (53) hold.From Theorem9, we can know that the conditions for smoothly joining two quartic rational triangular Said-Ball-like patches are similar to the ones necessary for joining two triangular Bernstein-Bézier cubic patches; see [28]. However, we can adjust the shape of the obtained G
1 continuous surface conveniently by changing the tension shape parameters in the quartic rational triangular Said-Ball-like patch. Figure 12 shows the G
1 continuous smooth surfaces generated by the joining of two quartic rational triangular Said-Ball-like patches with different shape parameters. The parameters take values ξ
=
1
,
ζ
=
-
1.G
1 continuous surfaces with different shape parameters.
(a)
(b)
(c)
(d)
(e)
(f)


## 4.1. Construction and Properties of the Basis

Here, we give the definition of the new quartic rational Said-Ball-like basis functions over a triangular domain as follows.Definition 5.
Letα
,
β
,
γ
∈
[
0
,
+
∞
), and D
∶
=
{
(
t
,
s
,
w
)
∣
t
+
s
+
w
=
1
,
t
≥
0
,
s
≥
0
,
w
≥
0
}; the following ten functions are defined as new quartic rational Said-Ball-like basis functions, with three shape parameters α, β, and γ, over the triangular domain D:
(29)
B
3,0
,
0
3
(
t
,
s
,
w
)
=
t
2
1
+
α
(
1
-
t
)
,
B
0,3
,
0
3
(
t
,
s
,
w
)
=
s
2
1
+
β
(
1
-
s
)
,
B
0,0
,
3
3
(
t
,
s
,
w
)
=
w
2
1
+
γ
(
1
-
w
)
,
B
2,1
,
0
3
(
t
,
s
,
w
)
=
t
2
s
[
2
+
α
+
2
α
(
1
-
t
)
]
1
+
α
(
1
-
t
)
,
B
2,0
,
1
3
(
t
,
s
,
w
)
=
t
2
w
[
2
+
α
+
2
α
(
1
-
t
)
]
1
+
α
(
1
-
t
)
,
B
1,2
,
0
3
(
t
,
s
,
w
)
=
t
s
2
[
2
+
β
+
2
β
(
1
-
s
)
]
1
+
β
(
1
-
s
)
,
B
0,2
,
1
3
(
t
,
s
,
w
)
=
s
2
w
[
2
+
β
+
2
β
(
1
-
s
)
]
1
+
β
(
1
-
s
)
,
B
1,0
,
2
3
(
t
,
s
,
w
)
=
t
w
2
[
2
+
γ
+
2
γ
(
1
-
w
)
]
1
+
γ
(
1
-
w
)
,
B
0,1
,
2
3
(
t
,
s
,
w
)
=
s
w
2
[
2
+
γ
+
2
γ
(
1
-
w
)
]
1
+
γ
(
1
-
w
)
,
B
1,1
,
1
3
(
t
,
s
,
w
)
=
1
-
∑
i
+
j
+
k
=
3
,
i
·
j
·
k
≠
1
‍
B
i
,
j
,
k
3
(
t
,
s
,
w
)
.Remark 6.
In the following discussion, we will denote the new quartic rational Said-Ball-like basis functions asB
i
,
j
,
k
3
(
t
,
s
,
w
;
α
,
β
,
γ
), i
,
j
,
k
∈
N, i
+
j
+
k
=
3. It is easy to check that for α
=
β
=
γ
=
0, the basis functions given in (29) are precisely the cubic Said-Ball basis functions over a triangular domain; see [8].From the expressions of the new quartic rational Said-Ball-like basis functions over a triangular domain given in (29), we can obtain the following important properties of the new basis.Theorem 7.
The basis functions over a triangular domain given in (29) have the following properties. (a)
Partition of unity:∑
i
+
j
+
k
=
3
‍
B
i
,
j
,
k
3
(
t
,
s
,
w
)
=
1.
(b)
Nonnegativity:B
i
,
j
,
k
3
(
t
,
s
,
w
)
≥
0,  i
,
j
,
k
∈
N, i
+
j
+
k
=
3.
(c)
Property at the corner points: fori
,
j
,
k
∈
N, i
+
j
+
k
=
3, we have
(30)
B
i
,
j
,
k
3
(
1,0
,
0
)
=
{
1
,
i
=
3
,
0
,
i
≠
3
,
B
i
,
j
,
k
3
(
0,1
,
0
)
=
{
1
,
j
=
3
,
0
,
j
≠
3
,
B
i
,
j
,
k
3
(
0,0
,
1
)
=
{
1
,
k
=
3
,
0
,
k
≠
3
.
(d)
Derivative at the corner points: fort
,
s
,
1
-
t
-
s
≥
0, i
,
j
,
k
∈
N, and i
+
j
+
k
=
3, we have
(31)
∂
B
i
,
j
,
k
3
(
t
,
s
,
1
-
t
-
s
)
∂
t
|
(
1,0
,
0
)
=
{
2
+
α
,
(
i
,
j
,
k
)
=
(
3,0
,
0
)
,
-
2
-
α
,
(
i
,
j
,
k
)
=
(
2,0
,
1
)
,
0
,
o
t
h
e
r
,
∂
B
i
,
j
,
k
3
(
t
,
s
,
1
-
t
-
s
)
∂
s
|
(
1,0
,
0
)
=
{
2
+
α
,
(
i
,
j
,
k
)
=
(
2,1
,
0
)
,
-
2
-
α
,
(
i
,
j
,
k
)
=
(
2,0
,
1
)
,
0
,
o
t
h
e
r
,
∂
B
i
,
j
,
k
3
(
t
,
s
,
1
-
t
-
s
)
∂
t
|
(
0,1
,
0
)
=
{
2
+
β
,
(
i
,
j
,
k
)
=
(
1,2
,
0
)
,
-
2
-
β
,
(
i
,
j
,
k
)
=
(
0,2
,
1
)
,
0
,
o
t
h
e
r
,
∂
B
i
,
j
,
k
3
(
t
,
s
,
1
-
t
-
s
)
∂
s
|
(
0,1
,
0
)
=
{
2
+
β
,
(
i
,
j
,
k
)
=
(
0,3
,
0
)
,
-
2
-
β
,
(
i
,
j
,
k
)
=
(
0,2
,
1
)
,
0
,
o
t
h
e
r
,
∂
B
i
,
j
,
k
3
(
t
,
s
,
1
-
t
-
s
)
∂
t
|
(
0,0
,
1
)
=
{
2
+
γ
,
(
i
,
j
,
k
)
=
(
1,0
,
2
)
,
-
2
-
γ
,
(
i
,
j
,
k
)
=
(
0,0
,
3
)
,
0
,
o
t
h
e
r
,
∂
B
i
,
j
,
k
3
(
t
,
s
,
1
-
t
-
s
)
∂
s
|
(
0,0
,
1
)
=
{
2
+
γ
,
(
i
,
j
,
k
)
=
(
0,1
,
2
)
,
-
2
-
γ
,
(
i
,
j
,
k
)
=
(
0,0
,
3
)
,
0
,
o
t
h
e
r
.
(e)
Boundary property: when one of the three variablesw is taken as zero, the ten quartic rational basis functions B
i
,
j
,
k
3
(
t
,
s
,
w
) degenerate to the corresponding quartic rational Said-Ball-like basis functions B
i
(
t
;
β
,
α
) (notice s
=
1
-
t) given in (1).
(f)
Linear independence:{
B
i
,
j
,
k
3
(
t
,
s
,
w
)
,
j
+
j
+
k
=
3
} are linearly independent.Proof.
We will prove(
b
) and (
f
). Simple and direct computation can give out the remaining properties.(b)
For anyα
,
β
,
γ
∈
[
0
,
+
∞
), i
,
j
,
k
∈
N,  i
+
j
+
k
=
3, and i
·
j
·
k
≠
1, B
i
,
j
,
k
3
(
t
,
s
,
w
)
≥
0 is obvious. Furthermore, for B
1,1
,
1
3
(
t
,
s
,
w
), by directly computing, we have
(32)
B
1,1
,
1
3
(
t
,
s
,
w
)
=
1
-
∑
i
+
j
+
k
=
3
,
i
·
j
·
k
≠
1
‍
B
i
,
j
,
k
3
(
t
,
s
,
w
)
=
1
-
[
3
(
t
2
+
s
2
+
w
2
)
-
2
(
t
3
+
s
3
+
w
3
)
]
=
6
t
s
w
≥
0
.
(f)
Forα
,
β
,
γ
∈
[
0
,
+
∞
), ξ
i
,
j
,
k
∈
R
(
i
+
j
+
k
=
3
), we consider a linear combination
(33)
∑
i
+
j
+
k
=
3
‍
ξ
i
,
j
,
k
B
i
,
j
,
k
3
(
t
,
s
,
w
)
=
0
.
Letw
=
0; we have
(34)
∑
i
=
0
3
‍
ξ
i
,
3
-
i
,
0
B
i
(
t
;
β
,
α
)
=
0
.
Differentiating with respect to the variablet on both sides, we have
(35)
∑
i
=
0
3
‍
ξ
i
,
3
-
i
,
0
B
i
′
(
t
;
β
,
α
)
=
0
.
Fort
=
0, from (34) and (35), we get
(36)
ξ
0,3
,
0
=
0
,
(
2
+
β
)
(
ξ
1,2
,
0
-
ξ
0,3
,
0
)
=
0
.
Thus, we haveξ
0,3
,
0
=
ξ
1,2
,
0
=
0. And for t
=
1, from (34) and (35), we can also obtain ξ
3,0
,
0
=
ξ
2,1
,
0
=
0. Similarly, ξ
i
,
0,3
-
i
=
ξ
0
,
i
,
3
-
i
=
0, i
=
0,1
,
2,3. And finally, ξ
1,1
,
1
=
0.
These imply the theorem.Figure10 shows some plots of quartic rational Said-Ball-like basis functions over a triangular domain. The three shape parameters take values α
=
0, β
=
1, γ
=
2.Some plots of quartic rational Said-Ball-like basis functions over a triangular domain.
(a)
(b)
(c)
(d)


## 4.2. Definition and Properties of the Quartic Rational Triangular Said-Ball-Like Patch

Definition 8.
Letα
,
β
,
γ
∈
[
0
,
+
∞
), given control points P
i
j
k
∈
R
3
(
i
,
j
,
k
∈
N
,
i
+
j
+
k
=
3
) and a triangular domain D
=
{
(
t
,
s
,
w
)
∣
t
+
s
+
w
=
1
,
t
≥
0
,
s
≥
0
,
w
≥
0
}. We call
(37)
R
(
t
,
s
,
w
)
=
∑
i
+
j
+
k
=
3
‍
B
i
,
j
,
k
3
(
t
,
s
,
w
)
P
i
,
j
,
k
,
(
t
,
s
,
w
)
∈
D
the quartic rational triangular Said-Ball-like patch with three shape parameters α
,
β
,
γ.From the properties of the quartic rational Said-Ball-like basis functions over a triangular domain, some properties of the quartic rational triangular Said-Ball-liek patch (37) can be obtained easily as follows.(a)
Affine invariance and convex hull properties: since the basis functions (29) have the properties of partition of unity and nonnegativity, we can see that the corresponding patch (37) has affine invariance and convex hull property.
(b)
Geometric properties at the corner points: direct computation gives that(38)
R
(
1,0
,
0
)
=
P
3,0
,
0
,
R
(
0,1
,
0
)
=
P
0,3
,
0
,
R
(
0,0
,
1
)
=
P
0,0
,
3
.
These indicate that the patch (37) interpolates at the corner points.
(c)
Tangent planes at the corner points: letw
=
1
-
s
-
t; we have
(39)
∂
R
(
t
,
s
,
w
)
∂
t
|
(
1,0
,
0
)
=
(
2
+
α
)
(
P
3,0
,
0
-
P
2,0
,
1
)
,
∂
R
(
t
,
s
,
w
)
∂
s
|
(
1,0
,
0
)
=
(
2
+
α
)
(
P
2,1
,
0
-
P
2,0
,
1
)
,
∂
R
(
t
,
s
,
w
)
∂
t
|
(
0,1
,
0
)
=
(
2
+
β
)
(
P
1,2
,
0
-
P
0,2
,
1
)
,
∂
R
(
t
,
s
,
w
)
∂
s
|
(
0,1
,
0
)
=
(
2
+
β
)
(
P
0,3
,
0
-
P
0,2
,
1
)
,
∂
R
(
t
,
s
,
w
)
∂
t
|
(
0,0
,
1
)
=
(
2
+
γ
)
(
P
1,0
,
2
-
P
0,0
,
3
)
,
∂
R
(
t
,
s
,
w
)
∂
s
|
(
0,0
,
1
)
=
(
2
+
γ
)
(
P
0,1
,
2
-
P
0,0
,
3
)
.
These indicate that the tangent planes at the three corner points (
1,0
,
0
), (
0,1
,
0
), and (
0,0
,
1
) are the three planes spanned by the control points P
3,0
,
0, P
2,1
,
0, and P
2,0
,
1; P
0,3
,
0, P
1,2
,
0, and P
0,2
,
1; and
P
0,0
,
3, P
1,0
,
2,  and  P
0,1
,
2, respectively.
(d)
Boundary property: forw
=
0, R
(
t
,
s
,
w
) is a quartic rational Said-Ball-like curve with two shape parameters α and β. And similarly, R
(
0
,
s
,
w
) and R
(
t
,
0
,
w
) both are quartic rational Said-Ball-like curves with shape parameters β, γ and α, γ, respectively.
(e)
Shape adjustable property: without changing the control net, we can adjust the shape of the quartic rational triangular Said-Ball-like patch conveniently by using the three shape parametersα, β, and γ. As the three shape parameters increase at the same time, the patch will be made close to the control net. Thus the three shape parameters α, β, γ serve as tension parameters. Furthermore, from the boundary property of the patch, we can see that the three shape parameters α, β, and γ have nothing to do with the boundary curves R
(
0
,
s
,
w
), R
(
t
,
0
,
w
), and R
(
t
,
s
,
0
), respectively. These imply that altering the value of a single shape parameter, one corresponding boundary curve of the generated patch will not change.Figure11 shows the quartic rational triangular patches and the effect on the patches by altering the values of the shape parameters without changing the control points.Quartic rational triangular Said-Ball-like patches with different shape parameters.
(a)
(b)
(c)
(d)
(e)
(f)


## 4.3. De Casteljau-Type Algorithm

The classical de Casteljau algorithm is a stable and efficient process for computing the triangular Bernstein-Bézier patch. Here, we will develop a de Casteljau-type algorithm for computing the proposed quartic rational triangular Said-Ball-like patch. By setting(40)
P
2,0
,
0
1
∶
=
1
1
+
α
(
1
-
t
)
P
3,0
,
0
+
α
s
1
+
α
(
1
-
t
)
P
2,1
,
0
+
α
w
1
+
α
(
1
-
t
)
P
2,0
,
1
,
P
1,1
,
0
1
∶
=
t
P
2,1
,
0
+
s
P
1,2
,
0
+
w
P
1,1
,
1
,
P
1,0
,
1
1
∶
=
t
P
2,0
,
1
+
s
P
1,1
,
1
+
w
P
1,0
,
2
,
P
1,1
,
0
1
∶
=
t
P
2,1
,
0
+
s
P
1,2
,
0
+
w
P
1,1
,
1
,
P
0,2
,
0
1
∶
=
β
t
1
+
β
(
1
-
s
)
P
1,2
,
0
+
1
1
+
β
(
1
-
s
)
P
0,3
,
0
+
β
w
1
+
β
(
1
-
s
)
P
0,2
,
1
,
P
0,1
,
1
1
∶
=
t
P
1,1
,
1
+
s
P
0,2
,
1
+
w
P
0,1
,
2
,
P
1,0
,
1
1
∶
=
t
P
2,0
,
1
+
s
P
1,1
,
1
+
w
P
1,0
,
2
,
P
0,1
,
1
1
∶
=
t
P
1,1
,
1
+
s
P
0,2
,
1
+
w
P
0,1
,
2
,
P
0,0
,
2
1
∶
=
γ
t
1
+
γ
(
1
-
w
)
P
1,0
,
2
+
γ
s
1
+
γ
(
1
-
w
)
P
0,1
,
2
+
1
1
+
γ
(
1
-
w
)
P
0,0
,
3
,
we have
(41)
R
(
t
,
s
,
w
)
=
t
(
t
P
2,0
,
0
1
+
s
P
1,1
,
0
1
+
w
P
1,0
,
1
1
)
+
s
(
t
P
1,1
,
0
1
+
s
P
0,2
,
0
1
+
w
P
0,1
,
1
1
)
+
w
(
t
P
1,0
,
1
1
+
s
P
0,1
,
1
1
+
w
P
0,0
,
2
1
)
.
Furthermore, there are three points at the second level:
(42)
P
1,0
,
0
2
∶
=
t
P
2,0
,
0
1
+
s
P
1,1
,
0
1
+
w
P
1,0
,
1
1
,
P
0,1
,
0
2
∶
=
t
P
1,1
,
0
1
+
s
P
0,2
,
0
1
+
w
P
0,1
,
1
1
,
P
0,0
,
1
2
∶
=
t
P
1,0
,
1
1
+
s
P
0,1
,
1
1
+
w
P
0,0
,
2
1
,
which lead to
(43)
R
(
t
,
s
,
w
)
=
t
P
1,0
,
0
2
+
s
P
0,1
,
0
2
+
w
P
0,0
,
1
2
:
=
P
0,0
,
0
3
.
From (41) and (43), we can immediately obtain the following de Casteljau-type algorithm:
(44)
P
i
,
j
,
k
m
=
f
i
+
1
,
j
,
k
m
-
1
(
t
,
s
,
w
)
P
i
+
1
,
j
,
k
m
-
1
+
g
i
,
j
+
1
,
k
m
-
1
(
t
,
s
,
w
)
×
P
i
,
j
+
1
,
k
m
-
1
+
h
i
,
j
,
k
+
1
m
-
1
(
t
,
s
,
w
)
P
i
,
j
,
k
+
1
m
-
1
,
where m
=
1,2
,
3, i
+
j
+
k
=
3
-
m, i
,
j
,
k
≥
0, P
i
,
j
,
k
0
=
P
i
,
j
,
k and
(45)
f
i
+
1
,
j
,
k
m
-
1
(
t
,
s
,
w
)
=
{
1
1
+
α
(
1
-
t
)
,
(
m
,
i
,
j
,
k
)
=
(
1,2
,
0,0
)
,
β
t
1
+
β
(
1
-
s
)
,
(
m
,
i
,
j
,
k
)
=
(
1,0
,
2,0
)
,
γ
t
1
+
γ
(
1
-
w
)
,
(
m
,
i
,
j
,
k
)
=
(
1,0
,
0,2
)
,
t
,
other
,
g
i
,
j
+
1
,
k
m
-
1
(
t
,
s
,
w
)
=
{
α
s
1
+
α
(
1
-
t
)
,
(
m
,
i
,
j
,
k
)
=
(
1,2
,
0,0
)
,
1
1
+
β
(
1
-
s
)
,
(
m
,
i
,
j
,
k
)
=
(
1,0
,
2,0
)
,
γ
s
1
+
γ
(
1
-
w
)
,
(
m
,
i
,
j
,
k
)
=
(
1,0
,
0,2
)
,
s
,
other
,
h
i
,
j
,
k
+
1
m
-
1
(
t
,
s
,
w
)
=
{
α
w
1
+
α
(
1
-
t
)
,
(
m
,
i
,
j
,
k
)
=
(
1,2
,
0,0
)
,
β
w
1
+
β
(
1
-
s
)
,
(
m
,
i
,
j
,
k
)
=
(
1,0
,
2,0
)
,
1
1
+
γ
(
1
-
w
)
,
(
m
,
i
,
j
,
k
)
=
(
1,0
,
0,2
)
,
w
,
other
.


## 4.4. Joining Two Patches

In practical surface construction, we often need to join several patches together in order to generate shapes that are too complex to handle with a single patch. During the joining of quartic rational triangular Said-Ball-like patches, we need to control the smoothness of the connecting surface. For(
t
,
s
,
w
)
∈
D, let two quartic rational triangular Said-Ball-like patches be defined as
(46)
R
1
(
t
,
s
,
w
)
=
∑
i
+
j
+
k
=
3
‍
B
i
,
j
,
k
3
(
t
,
s
,
w
;
α
1
,
β
,
γ
)
P
i
,
j
,
k
,
(47)
R
2
(
t
,
s
,
w
)
=
∑
i
+
j
+
k
=
3
‍
B
i
,
j
,
k
3
(
t
,
s
,
w
;
α
2
,
β
,
γ
)
Q
i
,
j
,
k
.
It is apparent that if the control points satisfy
(48)
P
0
,
j
,
k
=
Q
0
,
j
,
k
,
j
,
k
∈
N
,
j
+
k
=
3
,
the two patches will join along a common boundary curve: R
1
(
0
,
s
,
w
)
=
R
2
(
0
,
s
,
w
), s
+
w
=
1. Thus the two patches clearly form a surface with positional continuity or a surface with C
0 continuity.For the common boundary curveR
1
(
0
,
s
,
1
-
s
), differentiating with respect to s, we have
(49)
d
R
1
(
0
,
s
,
1
-
s
)
d
s
=
s
[
2
+
β
+
β
(
1
-
s
)
]
[
1
+
β
(
1
-
s
)
]
2
(
P
0,3
,
0
-
P
0,2
,
1
)
+
6
s
(
1
-
s
)
(
P
0,2
,
1
-
P
0,1
,
2
)
+
(
1
-
s
)
[
2
+
γ
+
γ
s
]
[
1
+
γ
s
]
2
(
P
0,1
,
2
-
P
0,0
,
3
)
.ForR
1
(
t
,
s
,
1
-
t
-
s
) and R
2
(
t
,
s
,
1
-
t
-
s
), we do differentiate with respect to t
(50)
∂
R
1
(
t
,
s
,
1
-
t
-
s
)
∂
t
|
t
=
0
=
s
[
2
+
β
+
β
(
1
-
s
)
]
[
1
+
β
(
1
-
s
)
]
2
(
P
1,2
,
0
-
P
0,2
,
1
)
+
6
s
(
1
-
s
)
(
P
1,1
,
1
-
P
0,1
,
2
)
+
(
1
-
s
)
[
2
+
γ
+
γ
s
]
[
1
+
γ
s
]
2
(
P
1,0
,
2
-
P
0,0
,
3
)
,
(51)
∂
R
2
(
t
,
s
,
1
-
t
-
s
)
∂
t
|
t
=
0
=
s
[
2
+
β
+
β
(
1
-
s
)
]
[
1
+
β
(
1
-
s
)
]
2
(
Q
1,2
,
0
-
Q
0,2
,
1
)
+
6
s
(
1
-
s
)
(
Q
1,1
,
1
-
Q
0,1
,
2
)
+
(
1
-
s
)
[
2
+
γ
+
γ
s
]
[
1
+
γ
s
]
2
(
Q
1,0
,
2
-
Q
0,0
,
3
)
.The condition for smooth joining is that the vectors defined by (49), (50), and (51) should be coplanar for any s
∈
[
0,1
]; see [28]. It can be expressed as
(52)
∂
R
2
(
t
,
s
,
1
-
t
-
s
)
∂
t
|
t
=
0
=
ξ
d
R
1
(
0
,
s
,
1
-
s
)
d
s
+
ζ
∂
R
1
(
t
,
s
,
1
-
t
-
s
)
∂
t
|
t
=
0
,
where both ξ and ζ are constants. From these discussions, we can easily obtain a rule:
(53)
Q
1,2
,
0
-
Q
0,2
,
1
=
ξ
(
P
0,3
,
0
-
P
0,2
,
1
)
+
ζ
(
P
1,2
,
0
-
P
0,2
,
1
)
,
Q
1,1
,
1
-
Q
0,1
,
2
=
ξ
(
P
0,2
,
1
-
P
0,1
,
2
)
+
ζ
(
P
1,1
,
1
-
P
0,1
,
2
)
,
Q
1,0
,
2
-
Q
0,0
,
3
=
ξ
(
P
0,1
,
2
-
P
0,0
,
3
)
+
ζ
(
P
1,0
,
2
-
P
0,0
,
3
)
.In summary, we conclude the following theorem.Theorem 9.
Forα
l
,
β
,
γ
∈
[
0
,
+
∞
), l
=
1,2, the surface connecting (46) with (47) is G
1 continuous, on the condition that (48) and (53) hold.From Theorem9, we can know that the conditions for smoothly joining two quartic rational triangular Said-Ball-like patches are similar to the ones necessary for joining two triangular Bernstein-Bézier cubic patches; see [28]. However, we can adjust the shape of the obtained G
1 continuous surface conveniently by changing the tension shape parameters in the quartic rational triangular Said-Ball-like patch. Figure 12 shows the G
1 continuous smooth surfaces generated by the joining of two quartic rational triangular Said-Ball-like patches with different shape parameters. The parameters take values ξ
=
1
,
ζ
=
-
1.G
1 continuous surfaces with different shape parameters.
(a)
(b)
(c)
(d)
(e)
(f)


## 5. Conclusion

The four quartic rational Said-Ball-like basis functions have the properties of partition of unity, nonnegative property, and linear independence and include the cubic Said-Ball basis functions as a special case. The new proposedC
1 quartic rational Hermite interpolation spline can be used to construct C
1 positivity- or monotonicity-preserving interpolation splines by constraining the shape parameters in the spline. The quartic rational Said-Ball-like basis with three-shape parameters over a triangular domain is a new construction for geometric design and computing, which has the properties of partition of unity, nonnegativity, and linear independence, and includes the classical cubic Said-Ball basis over a triangular domain as a special case. Without changing the control net, the shape of the obtained patch can be adjusted conveniently by using the shape parameters. Future work will concentrate on applying the new proposed basis to construct shape preserving interpolation spline surfaces.



---

*Source: 857840-2014-06-26.xml*