#### Abstract

In this article, we present a new method to construct a family of -point binary subdivision schemes with one tension parameter. The construction of the family of schemes is based on repeated local translation of points by certain displacement vectors. Therefore, refinement rules of the -point schemes are recursively obtained from refinement rules of the -point schemes. Thus, we get a new subdivision scheme at each iteration. Moreover, the complexity, polynomial reproduction, and polynomial generation of the schemes are increased by two at each iteration. Furthermore, a family of interproximate subdivision schemes with tension parameters is also introduced which is the extended form of the proposed family of schemes. This family of schemes allows a different tension value for each edge and vertex of the initial control polygon. These schemes generate curves and surfaces such that some initial control points are interpolated and others are approximated.

#### 1. Introduction

Subdivision schemes are efficient tools for generating smooth curves/surfaces as the limit of an iterative process based on simple refinement rules starting from certain control points defining a control polygon/mesh. In recent years, subdivision schemes have been an important research area. These schemes provide an efficient way to describe curves, surfaces, and related geometric objects. Generally, subdivision schemes are classified as interpolatory or approximating, depending on whether the limit curve passes through all the given initial control points or not. Although approximating schemes yield smoother curves with higher order continuity, interpolating schemes are more useful for engineering applications as they preserve the shape of the coarse mesh. The special family of interpolatory schemes consists of the schemes with refinement rules that preserve the points associated with the coarse mesh and only generate new points related to the additional vertices of the refined mesh. An important family of interpolatory schemes was introduced by Deslauriers and Dubuc [1], and latest tools for its analysis were introduced by Amat et al. [2] whereas an important family of approximating subdivision schemes that is the dual counterparts of the schemes of Deslauriers and Dubuc [1] was proposed by Dyn et al. [3]. In 2017, Hameed and Mustafa [4] introduced an oscillation-free family of -point -ary subdivision schemes which can produce approximating curves with high continuity and less complexity.

However, there also exist the parametric subdivision schemes, which can produce family of smooth approximating curves for special choices of the tension parameters. The families of such schemes were introduced in [5–8]. Furthermore, a parametric subdivision scheme can be converted to the nonuniform subdivision scheme by defining the local tension parameter. Mustafa and Hameed [6, 7] converted their families of univariate and bivariate subdivision schemes to nonuniform approximating subdivision schemes by defining local tension parameters. A parametric subdivision scheme which can produce both interpolatory and approximating curves is called the combined subdivision scheme. If a combined subdivision scheme is capable to convert in the nonuniform form such that it can interpolate only certain initial control points and approximate all the other initial control points, then such a scheme will be interproximate scheme. Pan et al. [9] and Novara and Romani [10] presented the combined ternary subdivision schemes to fit interpolatory and approximating curves. However, they did not present the nonuniform form of their combined subdivision schemes.

Li and Zheng [11] combined the 4-point scheme of Dyn et al. [12] and the cubic B-spline binary refinement scheme to construct an interproximate subdivision scheme. Tan et al. [13] combined the 4-point scheme of Dyn et al. [12] and a 2-point corner cutting scheme to construct another interproximate subdivision scheme. However, these schemes give interproximate behavior but are not easy to implement and analyze. Nowadays, surface modeling is also modifying to fulfill the previous gaps. Pan et al. [14] presented a surface formulation method of multipatches based on rational splines. Nguyen-Thanh et al. [15] gave a subdivision approach for the minimal surface models on planar domains.

In this paper, we present a recursive method to construct the -point combined subdivision schemes with one tension parameter to control the given points of the initial polygon. The construction of combined subdivision schemes by a recursive method is a new trend in CAGD. We also present an extended form of this family of combined schemes by defining another tension parameter to control the insertion of new point between the given points in order to smooth the given polygon. Thus, the involvement of two tension parameters increases the flexibility in curves and surfaces fitting. Furthermore, we analyze the behavior of these combined subdivision schemes mathematically and show that these schemes not only give optimal smoothness but also give a desired reproduction degree. The results are then verified geometrically. Furthermore, we convert our schemes to interproximate schemes that generate smooth and oscillation-free curves and surfaces such that some initial control points are interpolated and others are approximated.

This article is organized as follows. Section 2 deals with some basic definitions and results. In Section 3, we construct three families of primal subdivision schemes. Section 4 deals with some important properties of the proposed families of schemes. In Section 5, numerical examples and comparisons are presented. A family of interproximate subdivision schemes and associated numerical examples are presented in Section 6. Conclusions are given in Section 7.

#### 2. Preliminaries

A general compact form of linear, uniform, and stationary binary univariate subdivision scheme which maps a polygon to a refined polygon is defined as

Since the subdivision scheme (1) is a binary scheme, the two rules for defining the new control points are as follows:

The symbol of the above subdivision scheme is given by the Laurent polynomial:where is called the mask of the subdivision scheme. Detailed information about refinement rules, Laurent polynomials, and convergence of a subdivision scheme can be found in [16–18]. The necessary condition for the convergence of the subdivision scheme (2) is that . The continuity of the subdivision schemes can be analyzed by the following theorems.

Theorem 1 (see [17]). *A convergent subdivision scheme corresponding to the symbolis -continuous iff the subdivision scheme corresponding to the symbol is convergent.*

Theorem 2 (see [17]). *The scheme corresponding to the symbol is convergent iff its difference scheme corresponding to the symbol is contractive, where . The scheme is contractive ifwhere are the coefficients of the scheme with symbol*

In a geometric context, subdivision schemes are further categorized into primal and dual subdivision schemes. The primal binary subdivision schemes are the schemes that leave or modify the old vertex points and create one new point at each old edge. Primal schemes can be interpolatory, approximating, or combined. Dual binary subdivision schemes on the other hand are the schemes that create two new points at the old edges and discard the old points. Most of the dual schemes are approximating subdivision schemes; however, recently Romani [19, 20] introduced interpolatory subdivision schemes that are dual in nature. Detailed information about the primal and dual subdivision schemes can be found in [16]. Furthermore, if one refinement rule of an approximating binary subdivision scheme (2) uses the affine combination of control points at level to get a new control point at level whereas the other refinement rule of (2) uses the affine combination of control points less than at level to get a new point at level , then that binary scheme is called the primal binary scheme. Moreover, every primal binary scheme is the relaxed subdivision scheme. Mathematical definition of primal and dual subdivision schemes is presented as follows.

*Definition 1. *Let the symbol of the symmetric subdivision scheme (2) defined in (3) can particularly be written as . If the symbol defined in (3) corresponding to the scheme satisfies the following condition:then is said to be a primal subdivision scheme. On the other hand, if it satisfies following condition:then is said to be a dual subdivision scheme.

The combined subdivision schemes are the schemes which depend on one or more tension parameters. Moreover, at the specific values of these parameters, these schemes can be regarded either as an approximating subdivision scheme or an interpolatory one. Interproximate subdivision schemes (see [11]) are the schemes which generate the limit curves that interpolate some of the vertices of the given control polygons, while approximate the other vertices of the given control polygons.

Generation and reproduction degrees are used to check the behaviors of a subdivision scheme when the original data points lie on the graph of a polynomial. Suppose that the original data points are taken from a polynomial of degree . If the control points of the limit curve lie on graph of the polynomial having same degree (i.e., ), then we say that the subdivision scheme generates polynomials of degree . If the control points of the limit curve lie on graph of the same polynomial, then we say that the subdivision scheme reproduces polynomials of degree . Mathematically, let denote the space of polynomials of degree and , ; an operator generates polynomials of degree if , whereas reproduces polynomials of degree if . Furthermore, the generation degree of a subdivision scheme is the maximum degree of polynomials that can theoretically be generated by the scheme, provided that the initial data are taken correctly. Evidently, it is not less than the reproduction degree. For exact definitions of polynomial generation and reproduction, the readers can consult [16, 21]. The following theorem is used to check the generation and reproduction degrees of the subdivision schemes in this paper.

Theorem 3 (see [21]). *A univariate convergent binary subdivision scheme performs the following functions:*(i)*Generates polynomials up to degree if and only if* *where denotes the -th derivative of with respect to evaluated at a point .*(ii)*Reproduces polynomials up to degree with respect to the parametrization with if and only if it generates polynomials of degree d and*

The support of a basic limit function and a subdivision scheme is the area of the limit curve that will be affected by the displacement of a single control point from its initial place. The part which is dependent on that given control point is called the support width of the given subdivision scheme. By following the approach of [22], we give following theorem to calculate the support width of a relaxed binary combined scheme or an interpolatory binary scheme.

Theorem 4. *The support width of a -point binary relaxed subdivision scheme is where , which implies that it vanishes outside the interval . The support width of a -point interpolatory binary scheme is , which implies that it vanishes outside the interval .*

#### 3. Construction of the Families of Subdivision Schemes

In this section, we present a family of -point relaxed combined subdivision schemes that is based on repeated local translation of points by using certain displacement vectors. Thus, the refinement rules of a member of the proposed family is recursively obtained by the refinement rules of one other member of this family, i.e., the refinement rules of a -point scheme for are recursively obtained from the refinement rules of the -point scheme for . We propose a new family of -point relaxed combined schemes with two tension parameters by extending the points of the family of -point relaxed combined schemes. Then, we modify the family of -point relaxed schemes to a family of -point interpolatory schemes by removing one of its tension parameters. Construction process for the family of -point relaxed combined schemes with one tension parameter is given as follows.

##### 3.1. Framework for the Construction of a Family of -Point Relaxed Schemes

The family of -point combined subdivision schemes which maps the polygon to the refined polygon is defined by the set of following refinement rules:where is used to calculate the complexity (number of control points at -th subdivision level used in the insertion of a new point at -th subdivision level is called the complexity) of the subdivision schemes and denotes the number of times subdivision is applied on the original data points. Hence, for each , the set represents the -th level subdivided points obtained by applying -times the -point relaxed subdivision scheme (11) on the initial data points , and is mask of the scheme (11) which is same at each level of refinement for a fix value of . The schematic sketches of both rules defined in (11) are presented in Figures 1(a) and 1(b).

**(a)**

**(b)**

**(c)**

**(d)**

The construction process of these rules is given as follows.

If , the two refinement rules of the 2-point relaxed scheme are obtained from (12). Hence, are the control points at first subdivision level obtained by the 2-point relaxed subdivision scheme on the initial control points . These two refinement rules are the initial refinement rules used to calculate the other refinement rules of proposed family of schemes for each successive value of . The initial refinement rules are defined aswhere .

Now, we calculate points of the -point relaxed subdivision scheme for . Hence, for a fix value of , the points of the -point relaxed subdivision scheme are obtained by moving the points to the new position according to the displacement vectors , where is the tension parameter with and .

Mathematically, for , the two refinement rules of the family of -point relaxed subdivision schemes at first level of subdivision are obtained by the following recurrence relation:where the vectors are calculated by the following recurrence relation:and initial values for relation (14) are

Here, are the initial control points.

While the points , , , and are the initial points of the 4-point, 6-point, and 8-point relaxed subdivision schemes obtained by substituting the values of equal to 1, 2, and 3, respectively, in (13) and (14). Since the proposed subdivision schemes are stationary, the refinement rules are same at each level of subdivision. Therefore, for other subdivision levels, we apply (11) while the coefficients of points remain same as the coefficients of points obtained from (13). Also, , , , and are the control points at -th subdivision level obtained by applying the 2-point, 4-point, 6-point, and 8-point relaxed subdivision schemes on the -th level points , , , and , respectively. Moreover, the points other than the initial control points hold the relation .

At each iteration, i.e., by substituting in (11), (13), and (14), we get a new binary primal -point subdivision scheme. The masks of these -point schemes by defining are tabulated in Table 1.

*Remark 1. *If , the family of scheme (11) reduces to the family of -point interpolatory schemes with symbolwhich is proposed by Deslauriers and Dubuc [1]. The continuity of -point interpolatory schemes is for and for .

##### 3.2. Interpretation of Framework 3.1 for

The refinement rules of the initial subdivision scheme defined in (12) are

Moreover, the initial values which will be used to calculate the vectors defined in (15) are

Now, we use initial relations (17) and (18) to calculate the refinement rules of 4-point relaxed scheme which will be obtained by putting in (13) and (14). Hence, for , we getwhere

Now, firstly we put and in (19) and then we use (17) and (21) in (19). Hence, we get the following 4-point relaxed subdivision scheme:

Step by step geometrical representations of the above procedure are shown in Figures 2 and 3. The description of Figure 2 is as follows. In Figure 2(a), the implementation of the initial subdivision scheme defined in (17) is given. In Figure 2(b), blue bullets show the points obtained by the relations defined in (18). Here, , , , , , and . In Figure 2(c), is the resultant vector of two vectors and . Similarly, is the resultant vector of and . The resultant vectors are obtained by adding two vectors using head to tail rule. The resultant vectors are denoted by blue solid lines while the other vectors are denoted by blue dashed lines. Moreover, the description of Figure 3 is as follows, In Figure 3(a), the geometrical representation of the vectors defined in (20) is given. Here, ; In Figure 3(b), the translation of the points and is shown by using vectors and to obtain the points and denoted by green bullets; In Figure 3(c), green bullets show the points of the subdivision scheme (21) constructed by the proposed framework.

**(a)**

**(b)**

**(c)**

**(a)**

**(b)**

**(c)**

##### 3.3. Extended Form of Framework 3.1 for Constructing a Family of -Point Relaxed Schemes

When , we add these weightsin (13), where . Hence, we get the family of -point combined relaxed schemes associated with the following refinement rules:where

The schematic sketches of these rules are given in Figures 1(c) and 1(d), and mask of the first three members of this family of schemes is given as follows:(i)When , (25) gives the primal 3-point relaxed scheme with mask(i)iWhen , (25) gives the primal 5-point relaxed scheme with mask(iii)When , (25) gives the primal 7-point relaxed scheme with mask

##### 3.4. Interpretation of Extended Form 3.3 for

When , (24) gives

Adding weights which are defined in (30) in the edge rule of (22), we get

Since the above scheme is stationary, the refinement rules of proposed 5-point relaxed scheme with two tension parameters are

*Remark 2. *(i)The schemes of [5] are the special cases of the proposed family of -point schemes.(ii)The family of -point interpolatory schemes with one tension parameter is obtained by putting in (25). The refinement rules of these schemes are given as follows:where is defined in (26).

#### 4. Analysis of the Families of Schemes

In this section, we present properties of the proposed families of schemes. In Table 2, we present “ranges of tension parameter ” for which the first six members of “the family of -point relaxed schemes” are -continuous. The continuity of the proposed schemes is analyzed with a computer algebra system like Mathematica/Maple by using Theorems 1 and 2. Similarly, continuity of the first three members of -point relaxed schemes and -point interpolatory schemes is presented in Tables 3 and 4, respectively, for specific ranges of tension parameters.

In Tables 4–6, we tabulate the support widths, degrees of polynomial generation, and degrees of polynomial reproduction of the proposed families of -point relaxed, -point relaxed, and -point interpolatory schemes, respectively. The generation and reproduction degrees of the proposed schemes are analyzed by using Theorem 3, while the support widths of the proposed schemes are calculated by using Theorem 4. Properties of some special members of the family of schemes (11) are presented in Table 7.

Let , , and denote the symbols of schemes (11), (25), and (33), respectively. By Definition 1, the following theorem can be easily proved.

Theorem 5. *The families of subdivision schemes (11), (25), and (33) are the families of primal schemes.*

*Proof. *Since the symbols associated with schemes (11), (25), and (33) satisfy the relations , , and , respectively, for all , then by Definition 1, these schemes are primal. This completes the proof.

Now, we check the property of polynomial generation and reproduction of the families of schemes , , and by using Theorem 3. We prove the following theorems for this purpose.

Theorem 6. * The families of subdivision schemes (11), (25), and (33) generate polynomials up to degree for all and and for all .*

*Proof. *It is to be noted that for all and , the results and are trivial for all . Furthermore, for and . Therefore, by Theorem 3, the result proved.

Theorem 7. * The families of subdivision schemes (11), (25), and (33) reproduce polynomials up to degree for all and and .*

*Proof. *Since by Theorem 5, the families of schemes (11), (25), and (33) are primal; hence, the parameter for all and and . Moreover, for and . Now, by combining these conditions with Theorem 6 and then by using Theorem 3, we get the required result.

*Remark 3. * Theorems 6 and 7 show that the schemes defined in (11), (25), and (33) generate and reproduce polynomials up to degree for all and . However, by choosing specific values of and , the polynomial generation and polynomial reproduction of these schemes can be increased. Tables 4, 6, and 7 summarize the generation and reproduction degrees of proposed schemes for specials choices of tension parameters.

In the coming theorem, we give the support width of the proposed families of schemes.

Theorem 8. * The support width of the family of scheme (11) is where . The support width of each family of subdivision schemes defined in (25) and (33) is .*

*Proof. *By Theorem 4, the result is trivial.

We prove the following theorem by using Theorems 1 and 2.

Theorem 9. * The subdivision schemes , , and are , , and , respectively, for some special conditions.*

*Proof. *The conditions for , , and continuities of the schemes , , and , respectively, are given as follows:

The subdivision scheme is ifwhere , , and .

The scheme is ifwhere , , , and .

Similarly, the subdivision scheme is ifwhere , , , , and .

*Remark 4. * Throughout the article, red bullets and red lines represent initial points and initial polygons/meshes, respectively.

#### 5. Numerical Examples and Comparisons

This section deals with the numerical examples of the proposed families of subdivision schemes. We also give some numerical and mathematical companions of the proposed schemes with the existing schemes. Numerical performance of 2-point, 3-point, 4-point, 5-point, 6-point, and 7-point relaxed subdivision schemes is shown in Figures 4(a), 4(b), 4(d), 4(e), 4(g), and 4(h), respectively. From these figures, it is easy to see that the tension parameters which are involved in the proposed schemes allow us to draw different models from same initial points. Similarly, geometrical behaviors of interpolatory 4-point, 6-point, and 8-point schemes for different values of tension parameters are shown in Figures 4(c), 4(f), and 4(i), respectively. An interesting geometrical behavior of 3-point, 5-point, and 7-point schemes is shown in Figures 5(a)‒5(h) and 6(a)‒6(d), respectively.

**(a)**

**(b)**

**(c)**

**(d)**

**(e)**

**(f)**

**(g)**

**(h)**

**(i)**

**(a)**

**(b)**

**(c)**

**(d)**

**(e)**

**(f)**

**(g)**

**(h)**

We apply these schemes to two different initial models with same values of the tension parameters. From these figures, we observe that the artifacts in the limit curve can be removed either by changing values of the tension parameters or by changing the initial polygons. While schemes proposed by Deslauriers and Dubuc [1], which are also the special cases of the proposed schemes for specific values of tension parameters and , do not have this characteristic (see Figures 6(e)–6(h)). Figures 7–9 show that the surfaces produced by the tensor product schemes of proposed primal schemes also give better numerical results than those of the tensor product schemes of primal schemes [1]. Table 8 gives comparisons between proposed families of primal schemes and the family of primal interpolatroy schemes of Deslauriers and Dubuc [1]. The parameters used in our families of subdivision schemes not only increase the choices of drawing different shapes but also increase the polynomial reproduction, polynomial generation, and smoothness of the proposed schemes. Moreover, we can draw interpolatory and approximating curves by using a single member of the family. Table 9 gives the comparisons of the proposed primal schemes with the primal approximating schemes of [6, 7]. Since approximating subdivision schemes give more smoothness in limits curves as comparative to the interpolating and combined schemes, some of the proposed schemes give lower level of continuity than that of the schemes of [6, 7]. However, the degrees of polynomial reproduction of the proposed schemes are higher than those of these approximating primal schemes.

**(a)**

**(b)**

**(c)**

**(d)**

**(e)**

**(f)**

**(g)**

**(h)**

**(a)**

**(b)**

**(c)**

**(d)**

**(e)**

**(f)**

**(g)**

**(h)**

**(i)**

**(j)**

**(k)**

**(l)**

**(a)**

**(b)**

**(c)**

**(d)**

**(e)**

**(f)**

**(g)**

**(h)**

**(i)**

**(j)**

**(k)**

**(l)**

**(a)**

**(b)**

**(c)**

**(d)**

**(e)**

**(f)**

**(g)**

**(h)**

**(i)**

**(j)**

**(k)**

**(l)**

#### 6. Interproximate Subdivision Schemes

In this section, we present a new family of subdivision schemes, that is, the family of interproximate subdivision schemes, for generating curves that interpolate certain given initial control points and approximate the other initial control points. By the interproximate subdivision scheme, only the initial control points specified to be interpolated are fixed and the other points are updated at each refinement step. The interproximate subdivision schemes can be defined by replacing and as the substitution of and in (25) and (26). In this interproximate subdivision process, the parameters control the interpolating property of the subdivision schemes and parameters control the approximating property of the subdivision schemes. Figures 10(a)–10(c) show the initial polygon and limit curves generated by the subdivision scheme using initial control points , and . Figures 10(d)–10(f) demonstrate that this scheme interpolates the control points in a local manner and uses a different value of tension parameter for each edge of the control polygon. Values of the tension parameters at first subdivision levels are shown in these figures. Whereas at the other subdivision levels, we use same interpolating values for the control points which are interpolated at the first subdivision levels and use the approximating values of the tension parameters for the modified and new inserted points. Figures 10(g)–10(l) show the limit curves generated by subdivision scheme using initial control points , , , , , , , , , and . In this figure, (i)(g) represents the initial polygon with indexed initial control points.(ii)(h) shows the limit curve that interpolates all the control points with .(iii)(i) represents the limit curve that approximates all the initial control points with .(iv)(j) shows the interproximate limit curve with = , , , , , , , , , at first subdivision level. Whereas at other subdivision levels, we use for the points , and for all the other points.(v)(k) shows the interproximate limit curve with = [, , , , , , , , , at first subdivision level. Whereas at other subdivision levels, we use for the points , and for all the other points.(vi)(l) shows the interproximate limit curve with = [, , , , , , , , at first subdivision level. Whereas at other subdivision levels, we use for the points , , and for all the other points.

**(a)**

**(b)**

**(c)**

**(d)**

**(e)**

**(f)**

**(g)**

**(h)**

**(i)**

**(j)**

**(k)**

**(l)**

These figures show that proposed schemes can interpolate the initial control points which are chosen by the programmers to be interpolated.

Figure 11 shows the limit surfaces generated by tensor product subdivision scheme of scheme using initial control points , , , , , , , , , , (, 4), , , , (, 4), , , , , and , where Figure 11(a) shows the limit surface that interpolates all the initial control points with , Figure 11(b) shows the limit surface that approximates all the initial control points with , and Figure 11(c) shows the limit surface that interpolates only the control points , , , and at each level of subdivision with and approximates all the other control points at each level of subdivision with . Similarly, a programmer can choose other control points of his choice to be interpolated by using the tensor product schemes of the proposed schemes. Moreover, the extension of these schemes to the more general schemes which can produce surfaces with arbitrary topology is a direction for future study.

**(a)**

**(b)**

**(c)**

#### 7. Conclusion

In this article, we have proposed a recursive method to generate the refinement rules of combined subdivision schemes. On the basis of that recursive refinement rules, we have presented the family of -point relaxed primal combined schemes, the family of -point relaxed combined schemes, and the family of -point interpolatory subdivision schemes with reproduction degrees , , and , respectively, at certain values of the tension parameters. In fact, when value of is increased by one, polynomial reproductions of the proposed families of schemes are increased by two. Similarly, polynomial generations of the proposed families of schemes are , , and , respectively. is also directly proportional to the polynomial generations of the schemes. The continuity of the proposed families may be increased by increasing . Our families of schemes not only give the flexibility in fitting limit curves/surfaces because of the involvement of tension parameters but also give the optimal polynomial reproduction, polynomial generation, and continuity than the existing primal schemes. Moreover, we converted the proposed family of -point combined subdivision schemes to the family of interproximate subdivision schemes by defining local parameters. One of these parameters is defined to control the interpolating property of the subdivision schemes and other one is defined to control the approximating property of the subdivision schemes. The interproximate subdivision schemes have applications in situations where some of the initial data points cannot be measured exactly. Future work is to do a theoretical study that how to choose values of tension parameters in an interproximate algorithm automatically.

#### Data Availability

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

#### Conflicts of Interest

The authors declare that they have no conflicts of interest regarding the publication of this paper.

#### Acknowledgments

This work was supported by the NRPU Project, no. 3183, Pakistan.