Mathematical Problems in Engineering

Volume 2019, Article ID 3057134, 9 pages

https://doi.org/10.1155/2019/3057134

## A Generalized Cubic Exponential B-Spline Scheme with Shape Control

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

Correspondence should be addressed to Baoxing Zhang; ten.haey@gnahzgnixoab

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 aswherewith 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 asIn 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 haveWhen , 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 havewhere 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.