Mathematical Problems in Engineering
Volume 2019 (2019), Article ID 3057134, 9 pages
https://doi.org/10.1155/2019/3057134

Research Article

A Generalized Cubic Exponential B-Spline Scheme with Shape Control

Baoxing Zhang, Hongchan Zheng, and Lulu Pan

Department of Applied Mathematics, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, China

Correspondence should be addressed to Baoxing Zhang; baoxingzhang@yeah.net

Received 30 January 2019; Accepted 2 May 2019; Published 3 June 2019

Academic Editor: Nhon Nguyen-Thanh

Copyright © 2019 Baoxing Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

In this paper, a generalized cubic exponential B-spline scheme is presented, which can generate different kinds of curves, including the conics. Such a scheme is obtained by generalizing the cubic exponential B-spline scheme based on an iteration from the generation of exponential polynomials and a suitable function with two parameters and . By changing the values of and , the sensitivity of the shape of the subdivision curve to the initial control value can be changed and different kinds of curves can then be obtained by adjusting the value of . For this new scheme, we show that, with any admissible choice of and , it owns the same smoothness order and support as the cubic exponential B-spline scheme. Besides, based on a different iteration and another suitable function, we construct a similar nonstationary scheme to generate more curves with different shapes and show the role of iterations and suitably chosen functions in the construction and analysis of such schemes. Several examples are given to illustrate the performance of our new schemes.

1. Introduction

Subdivision schemes are efficient tools to generate smooth curves/surfaces from a set of initial control points and they play an important role in computer graphics, wavelets, and other fields like biomedical imaging [1]. According to whether the refinement rules depend on the recursion level, subdivision schemes can be divided into stationary and nonstationary ones. Stationary schemes can generate algebraic polynomials while nonstationary ones can generate richer function spaces, such as the exponential polynomial spaces. As a result, nonstationary schemes can generate curves like hyperbolas or surfaces like spheres and other ones with different shapes, which can not be done using stationary schemes.

Since the nonstationary schemes can generate richer function spaces and more kinds of curves, there have been continuous works on the construction and analysis of nonstationary schemes. The exponential B-spline schemes [2] are such typical examples, which can generate exponential polynomials. Besides, Conti & Romani [3] gave conditions on the symbols of nonstationary schemes to reproduce exponential polynomials. Siddiqi et al. [4] presented ternary nonstationary schemes generating hyperbolas and parabolas. Zheng & Zhang [5] applied the push-back operation in the nonstationary case and constructed a combined non-stationary scheme generating different exponential polynomials. Asghar & Mustafa [6] constructed -ary nonstationary schemes which are new versions of the Lane-Riesenfeld algorithms. For other nonstationary schemes generating exponential polynomials, see [7–9] and the references therein. In fact, there are other nonstationary schemes generating curves with different kinds of shapes. Beccari et al. [10] proposed a ternary -point nonstationary interpolatory scheme, whose nonstationarity can be seen as the result of an iteration, and this scheme can generate curves with considerable variations of shapes. Similarly, Tan et al. [11] proposed a -point nonstationary approximating subdivision, which can be seen as constructed based on a different iteration and can also generate a wide variety of curves.

Due to nonstationary schemes’s ability in curve design, as illustrated above, in this paper, we aim to propose a new nonstationary subdivision scheme, which can generate curves with considerable variations of shapes and exponential polynomials as well. The inspiration comes from the works in [10, 11]. In fact, we start from the -convergent cubic exponential B-spline scheme [12], which generates the conics. To our purpose, we see the cubic exponential B-spline scheme as obtained based on an iteration coming from the generation of exponential polynomials and treat the coefficients of the subdivision rules as functions of this iteration. Then, together with a function with two parameters and , we can obtain a generalized cubic exponential B-spline scheme, which is just the one we want. For this new scheme, by changing the values of and , we can change the sensitivity of the shape of the obtained curve to the initial control value , and different kinds of curves, including the conics, can then be obtained by adjusting . We point out that compared with the cubic exponential B-spline scheme, this newly obtained one can generate curves with more kinds of shapes and, compared with the schemes in [10, 11], this new one enjoys the advantages like shorter support and generation of exponential polynomials. For such a new scheme, we show that, with any admissible choice of and , it keeps the same smoothness order and the support as the cubic exponential B-spline scheme. Besides, based on a different iteration and another suitable function, we also present a similar nonstationary scheme to generate curves with more kinds of shapes. This also shows the role of iterations and suitably chosen functions in the construction and analysis of such schemes. The performance of our schemes is illustrated by several numerical examples.

The rest of this paper is organized as follows. In Section 2, we review some known definitions and results about subdivision schemes and iterations. Section 3 is devoted to the construction and analysis of the generalized cubic exponential B-spline scheme. In Section 4, we present several examples and compare the new scheme with several existing nonstationary ones. In Section 5, we move a further step and construct a similar scheme based on a different iteration and a different suitable function. Section 6 concludes this paper.

2. Preliminary

In this section, we recall some basic definitions and known results about subdivision schemes and iterations to form the basis of the rest of this paper. Let denote the linear space of real sequences with finite support. For a sequence , its support is the finite set . Given an initial data sequence , we consider the nonstationary subdivision scheme

where is the -level subdivision operator and the sequence is the -level mask with finite support. We denote this scheme by and the so-called -level symbol of the scheme is the Laurent polynomial .

By attaching to the parameter values , , we say the subdivision scheme is -convergent if, for the initial data sequence , there exists a function satisfying

where denotes the sequence . If , we say the subdivision is -convergent.

In order to investigate the convergence and smoothness of nonstationary subdivision schemes, let us recall some definitions and results as follows.

Definition 1 (see [13]). A nonstationary subdivision scheme with the -level mask is said to be asymptotically similar to the stationary subdivision scheme with the mask , if the -level mask and the mask have the same support (i.e. for ) and satisfy

Definition 2 (see [14]). let be the th order differentiation operator. A nonstationary subdivision scheme with the -level symbol is said to satisfy the approximate sum rules of order if

satisfy

Theorem 3 (see [14]). Assume that the nonstationary subdivision scheme satisfies approximate sum rules of order and is asymptotically similar to a convergent stationary subdivision scheme who is -convergent. Then the nonstationary scheme is -convergent.

Now we recall some knowledge about the generation of exponential polynomials.

Definition 4 (see [3]). Let and with a finite set of real or imaginary numbers. The space of exponential polynomials is

The exponential polynomial space can be characterized as in the following lemma.

Lemma 5 (see [3]). Let and denote by the set of zeros with multiplicity satisfying

Then

Definition 6 (see [3]). We say the subdivision scheme is -generating if it is convergent and for , there exists an initial sequence uniformly sampled from , such that

Now let us now recall some known definitions and results about fixed point iterations.

Definition 7 (see [15]). We say is a fixed point for a given function if

The following result gives sufficient conditions for the existence and uniqueness of a fixed point and how to approximate it.

Theorem 8 (see [15]). Let be such that for all . Suppose, in addition, that exists on and that there exists a constant such that

Then, there exists a unique fixed point for on . Besides, for any , the sequence defined by

converges to the unique fixed point in .

3. The Generalized Cubic Exponential B-Spline Scheme

In this section, we construct the generalized cubic exponential B-spline scheme and then investigate its convergence and smoothness.

3.1. Construction of the Generalized Cubic Exponential B-Spline Scheme

Before we construct the generalized cubic exponential B-spline scheme, we briefly review the cubic exponential B-spline scheme [12], which can be written down as

where

with being a nonnegative or pure imaginary constant. From the definition of in (14), we see that and satisfies the iteration

with .

As is known, the cubic exponential B-spline scheme (13) is -convergent and can generate the function space in the sense of Definition 6 [5]. Thus, it can generate conic sections.

In fact, from the cubic exponential B-spline scheme (13), we can see that it is just the iteration in (15) that forces the subdivision rules of this scheme to depend on the recursive level . This means that the nonstationarity of this scheme results from the iteration in (15). Besides, we can see the coefficients in the corresponding subdivision rules as functions of this iteration. That is to say, there exists a function such that the cubic exponential B-spline scheme (13) can be rewritten as

In this way, if we replace the function or the iteration (15) in (16) by a different one, we can obtain a different nonstationary subdivision scheme.

Now based on this observation, let us construct the new generalized cubic exponential B-spline scheme. In fact, to obtain our new scheme, we replace the function by a more generalized one as follows:

with . Then, from (16), we can obtain a new scheme, which can be written as

Note that when one of the parameters and is and the other is , becomes and the scheme (18) reduces to the cubic exponential B-spline scheme (13). We point out that the scheme (18) is just the desired generalized cubic exponential B-spline scheme and we denote it by . From the definition of in (14), we see that . As a result, it can be seen that and the limit stationary scheme of is thus the cubic B-spline scheme.

In fact, we only modified the existing elements in the masks of the cubic exponential B-spline scheme. Thus, the support of the new scheme is the same as the cubic exponential B-spline scheme, i.e., .

3.2. Convergence and Smoothness

Now let us investigate the convergence and smoothness of the generalized cubic exponential B-spline scheme . In fact, we have the following result.

Theorem 9. For , the generalized cubic exponential B-spline scheme is -convergent.

Proof. We show that the generalized cubic exponential B-spline scheme satisfies approximate sum rules of order . Then by Theorem 3, we can conclude that the scheme is -convergent.
To show that the scheme satisfies approximate sum rules of order , we denote by the -level symbol of the scheme and then can be written down as

It can be computed that contains the factor and that

Therefore, from Definition 2, for and , we have

Together with the definition of , it can be seen that there exists a constant independent of such that

Therefore, to show that the scheme satisfies approximate sum rules of order , we only have to show .
Let , with , . When , choose ; then for , we see that there exists a constant satisfying

Therefore, from Theorem 8, there exists a unique fixed point for on and that the sequence converges to . In fact, the fixed point is . In this way, we have

When , notice that for . For , we still have

Therefore, from Theorem 8, there exists a unique fixed point for on , which, in fact, is just . In this case, similar to (24), we have

where is a positive constant independent of .
Therefore, by combining (24) and (26), we see that, for ,

and thus the scheme satisfies approximate sum rules of order . Then, from Theorem 3, the scheme is -convergent.

Remark 10. Note that can also be derived from the fact that with being a constant independent of . Here, we used the technique of fixed point iteration, which, we point out that, can also be used in the analysis of other nonstationary subdivision schemes, such as the ones in [10, 11]. This will be shown in Section 5.

4. Examples and Comparison

In this section, we present several numerical examples and compare it with some existing subdivision schemes to illustrate the performance of the scheme .

Figure 1 shows the curves generated by the scheme with , , and different values of . From Figure 1, we can see that, for , with a suitable choice of and , the scheme can indeed generate curves with a wide variety of shapes. Figure 2 shows how the parameters and affect the shape of the obtained curve and gives some hints on how to choose them to generate the curve we want.

Figure 1: Curves generated by the scheme with (left to right).

(a) Curves generated by

(b) Curves generated by

(c) Curves generated by

(d) Curves generated by

Figure 2: Curves generated by the scheme with different values of , , and .

Figure 2 shows the curves generated by the scheme with different values of , , and starting from the initial control points uniformly sampled from the unit circle. From Figure 2, we see that when both and are nonzero, the shape of the obtained curve is sensitive to the change of near . But, this is not the case if only one of and is . In particular, when and , the scheme reduces to the cubic exponential B-spline scheme and the curve generated with is exactly a circle. Similarly, the parabola and hyperbola can also be generated in this case. Besides, when , the scheme reduces to the cubic B-spline scheme, and the shape of the obtained curve can not be changed. From Figure 2, we can also see that when both and are nonzero, the scheme will get more sensitive to near if becomes bigger and thus can generate more kinds of curves with the change of near . Besides, with the increasing of , the obtained curve will tend to the initial control polygon.

Figure 3 shows the curves generated by the cubic B-spline scheme, the cubic exponential B-spline scheme (13) and the scheme with . We can see from Figure 3 that, for , when and are chosen large enough, the scheme performs better than the cubic B-spline scheme and the cubic exponential B-spline scheme.

Figure 3: Curves generated by the cubic B-spline scheme (left column) cubic exponential B-spline (middle column), and the scheme (right column) with .

Recall that the nonstationary subdivision schemes in [10, 11] can also generate different kinds of curves and we denote them by and , respectively. The scheme is a ternary interpolatory one while the schemes and are binary approximating ones. Table 1 shows the comparison between these schemes. From Table 1, we see that the new scheme outperforms the other two in terms of support.

Table 1: Comparison between different schemes.

Schemes

support

[-2.5,2.5]

smoothness order
2
2
3

type
approximating
interpolatory
approximating

p-ary
binary
ternary
binary

5. Further Discussion

Note that the scheme is obtained based on the iteration (15) and the function . In this section, based on a different iteration and another suitable function, we move a further step and try to obtain a similar scheme, which can also generate different kinds of curves. This will show us the role of fixed point iterations and suitably chosen functions in the construction and analysis of such schemes.

Recall that the iteration (15) can be written as with for . Now we replace by a different one , which maps its domain onto . Meanwhile, we also replace the function by a different one . Recall from Section 4 that when both and are nonzero, the shape of the obtained curve is sensitive to the change of near . Note that leads to and that . Therefore, to obtain a scheme similar to , we assume that there exists a point such that .

Specifically speaking, we take with and the function with . In this way, from , we can derive a new scheme, which can be written as

where the sequence is generated by with . We denote the scheme (28) by .

Similar to the iteration , it can be shown that, for , we have , which, in fact, is the fixed point of . Besides, notice that . Thus, the limit stationary scheme of the scheme is also the cubic B-spline scheme.

Now we investigate the convergence and smoothness of the newly obtained scheme . In fact, similar to Theorem 8, we have the following result.

Theorem 11. The new scheme is -convergent.

Proof. Denote by the -level symbol of the scheme . Then we have

Similar to the proof of Theorem 8, from Definition 6, for and , we have

Therefore, since , we have

where and is a positive constant independent of . Now we show that so that the scheme satisfies approximate sum rules of order .
In fact, similar to the sequence , for , we still have for and that

where is a positive constant independent of . Thus, and the scheme satisfies approximate sum rules of order . Then, by Theorem 3, the scheme is -convergent, since it is asymptotic similar to the -convergent cubic B-spline scheme.

Figures 4 and 5 show some curves generated by the scheme with different values of . From Figures 4 and 5, we see that, with , the scheme can indeed generate a wide variety of curves, including some interesting ones.

Figure 4: Curves generated the scheme with (left to right: a qudarifomun, a simple ‘China knot’ and an astroid).

Figure 5: Curves generated the scheme with (left to right).

6. Conclusion

In this paper, a generalized cubic exponential B-spline scheme is presented, which can generate different kinds of curves, including the conics. The key ingredients of the construction and analysis is the iteration (15) coming from the generation of exponential polynomials and a suitable function with two parameters and . By adjusting the values of and , we can change the sensitivity of the shape of the obtained curve to the initial control value so as to generate various kinds of curves, including the conics. For this new scheme, we show that, with any admissible choice of and , it keeps the same smoothness order and support as the cubic exponential B-spline scheme. Some hints on how to choose and to generate the curves we want are also given. Besides, based on a different iteration and another suitable function, we also obtained a different nonstationary scheme, which can also generate a wide variety of curves with the change of the initial control value. This shows the role of fixed point iterations and suitably chosen functions in the construction and analysis of such schemes.

Data Availability

The data used to support the findings of this study are included within the article.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This is paper is supported by the National Science Foundation for Young Scientists of China (Grant No. 61801389).

References

A. Badoual, P. Novara, L. Romani, D. Schmitter, and M. Unser, “A non-stationary subdivision scheme for the construction of deformable models with sphere-like topology,” Graphical Models, vol. 94, pp. 38–51, 2017.

C. Vonesch, T. Blu, and M. Unser, “Generalized Daubechies wavelet families,” IEEE Transactions on Signal Processing, vol. 55, no. 9, pp. 4415–4429, 2007.

C. Conti and L. Romani, “Algebraic conditions on non-stationary subdivision symbols for exponential polynomial reproduction,” Journal of Computational and Applied Mathematics, vol. 236, no. 4, pp. 543–556, 2011.

S. S. Siddiqi, W. u. Salam, and K. Rehan, “Hyperbolic forms of ternary non-stationary subdivision schemes originated from hyperbolic B-splines,” Journal of Computational and Applied Mathematics, vol. 301, pp. 16–27, 2016.

H. Zheng and B. Zhang, “A non-stationary combined subdivision scheme generating exponential polynomials,” Applied Mathematics and Computation, vol. 313, pp. 209–221, 2017.

M. Asghar and G. Mustafa, “Family of a-Ary univariate subdivision schemes generated by Laurent polynomials,” Mathematical Problems in Engineering, vol. 2018, Article ID 7824279, 11 pages, 2018.

B. Jeong, Y. J. Lee, and J. Yoon, “A family of non-stationary subdivision schemes reproducing exponential polynomials,” Journal of Mathematical Analysis and Applications, vol. 402, no. 1, pp. 207–219, 2013.

M.-e. Fang, W. Ma, and G. Wang, “A generalized curve subdivision scheme of arbitrary order with a tension parameter,” Computer Aided Geometric Design, vol. 27, no. 9, pp. 720–733, 2010.

M. K. Jena, P. Shunmugaraj, and P. C. Das, “A subdivision algorithm for trigonometric spline curves,” Computer Aided Geometric Design, vol. 19, no. 1, pp. 71–88, 2002.

C. Beccari, G. Casciola, and L. Romani, “An interpolating 4-point C₂ ternary non-stationary subdivision scheme with tension control,” Computer Aided Geometric Design, vol. 24, no. 4, pp. 210–219, 2007.

J. Tan, J. Sun, and G. Tong, “A non-stationary binary three-point approximating subdivision scheme,” Applied Mathematics and Computation, vol. 276, pp. 37–43, 2016.

G. Morin, J. Warren, and H. Weimer, “A subdivision scheme for surfaces of revolution,” Computer Aided Geometric Design, vol. 18, no. 5, pp. 483–502, 2001.

C. Conti, N. Dyn, C. Manni, and M.-L. Mazure, “Convergence of univariate non-stationary subdivision schemes via asymptotic similarity,” Computer Aided Geometric Design, vol. 37, pp. 1–8, 2015.

M. Charina, C. Conti, N. Guglielmi, and V. Protasov, “Regularity of non-stationary subdivision: a matrix approach,” Numerische Mathematik, vol. 135, no. 3, pp. 639–678, 2017.

J. D. Faires and R. L. Burden, Numerical Analysis, Brooks/Cole Publishing., 9th edition, 2011.