A New Paradigm to Design a Class of Combined Ternary Subdivision Schemes

Subdivision schemes play a vital role in curve modeling. /e curves produced by the class of (2n + 2)-point ternary scheme (Deslauriers and Dubuc (1989)) interpolate the given data while the curves produced by a class of (2n + 2)-point ternary B-spline schemes approximate the given data. In this research, we merge these two classes to introduce a consolidated and unified class of combined subdivision schemes with two shape control parameters in order to grow versatility for overseeing valuable necessities. However, the proposed class of subdivision schemes gives optimal smoothness in the final shapes, yet we can increase its smoothness by using a proposed general formula in form of its Laurent polynomial. /e theoretical analysis of the class of subdivision schemes is done by using various mathematical tools and using their coding in the Maple environment. /e graphical analysis of the class of schemes is done in the Maple environment by writing the codes based on the recursive mathematical expressions of the class of subdivision schemes.


Introduction
Nowadays, subdivision schemes have got great importance in the field of geometric modeling. It is an innovation which creates smooth shapes. is technique produces a sequence of refined polygons which converge to a limiting shape. New points are added at each refinement level in order to get a smooth final shape. e number of points which are inserted at each refinement level is known as the arity of the curve subdivision scheme. Binary schemes insert two new points at each refinement level between every old consecutive pair of points of the previous refinement level [1]. Similarly, ternary subdivision schemes insert three new points at each refinement level between every old consecutive pair of points of the previous refinement level. Hence, ternary schemes smooth the given sketch in fewer subdivision steps as compared to the binary subdivision schemes. If we move the single point of the control polygon, then the shape of the curve changes over the specific region. is region is known as the support of the scheme. Subdivision schemes give us local control on the shapes. Schemes with small support give better local control on shapes as compared to the schemes with large support size. Ternary schemes give us small support as compared to the binary subdivision scheme and hence give better local control on the shapes. Because of these two main characteristics of ternary schemes, we consider them superior to the binary subdivision schemes.
Subdivision schemes can also produce the shapes which pass through the initial data. ese types of subdivision schemes are known as interpolatory subdivision schemes. ese schemes have been introduced by [2][3][4][5][6]. e other types of subdivision schemes produce shapes which do not pass through the initial data.
is type of subdivision schemes is known as approximating subdivision schemes and was introduced by [7][8][9][10]. e analysis of both types of schemes is done by [11,12]. In [13][14][15][16], the subdivision schemes are introduced with parameters which can produce both the interpolatory and approximating shapes. e combined behaviour of these combined subdivision schemes got more attention in curve modeling.
In this paper, we present a class of ternary combined schemes which is obtained from the well-known classes of interpolatory and approximating subdivision schemes. We unify interpolatory and approximating classes of subdivision schemes into a single class of combined schemes by applying certain mathematical operations on their refinement rules. Consequently, we get a class of (2n + 2)-point ternary combined subdivision schemes. Two shape parameters are also inserted in the refinement rules to control the appearance of the limiting shapes. A sketch of our construction procedure is shown in Figure 1.
e remaining layout of the paper is as follows: in Section 2, basic definitions, notations, and established tools are introduced. In Section 3, we construct a parametric class of (2n + 2)-point ternary relaxed subdivision schemes. is class depends on two parameters. In Section 4, we discuss several features of this class. In Section 5, we present the geometrical influence of the schemes on the shapes. e conclusion of this research is presented in Section 6.

Preliminaries
In this section, we review some fundamental definitions and known realities about subdivision schemes, which structure the basis of the remainder of this paper. If q k � q k i i∈Z and q k+1 � q k+1 i i∈Z are two polygons at kth and (k + 1) the level, then the ternary subdivision scheme (SS) a which produces q k+1 from q k is defined as where the set a � a i : i ∈ Z of coefficients is called the mask of the subdivision scheme. For the ternary subdivision scheme (SS) a , a point at (k + 1)-th level is calculated by (SS) a q k 3i+l � q k+1 3i+l � c∈Z a 3c+l q k i− c , i ∈ Z, 0 ≤ l ≤ 2. (2) A necessary condition of the subdivision scheme for uniform convergence is that j∈Z a 3j � j∈Z a 3j+1 � j∈Z a 3j+2 � 1. (3) In order to analyze the characteristics of the subdivision scheme, the z-transform of the mask is which is also known as the Laurent polynomial of the scheme.

Definition 1.
A subdivision scheme is uniformly convergent if, for any initial data q 0 � q 0 i : i ∈ Z , there exists a continuous function f, such that for any closed interval I ⊂ R that satisfies where f � S ∞ q 0 .
Definition 2. If we rewrite the Laurent polynomial of (SS) a as a(z) � (1 + z + z 2 /3) k δ(z), where δ(z) has no factor of the form (1 + z + z 2 ) and m 0 , . . . , m l are nonzero coefficients of δ(z). Let F 0 , F 1 , . . . , F l be l × l matrices with the elements given by Hölders regularity/continuity is defined as r � k − log n (μ), whereas the parameter μ is known as a joint spectral radius of F 0 , F 1 , . . . , F l . It is bounded below by spectral radii and from above by the norm of matrices F 0 , F 1 , . . . , F l . If lower and upper bounds coincide, an explicit formula for the joint spectral radius is obtained: Theorem 1 (see [17]). If S a is the subdivision scheme with Laurent polynomial a(z), then S a is said to be C j -continuous if the subdivision scheme (1/3)S n is contractive. at is, where

Formulation of the Class of Combined Schemes
Here, we construct and unify the generalized form of the refinement rules of the class of interpolating and approximating schemes. e construction of the class of combined subdivision schemes is based on two classes of subdivision schemes. One of which is the class of (2n + 2)-point ternary interpolatory subdivision schemes (CETISS), which is constructed by the Lagrange interpolating polynomial, and the other one is the class of (2n + 2)-point relaxed ternary approximating subdivision schemes (CETASS), which is constructed by the B-spline basis function. We merge these classes of schemes in a specific manner such that we get a single class of (2n + 2)-point combined schemes from them.

Mathematical Representation of the Construction
Procedure. In this subsection, we present the stepwise procedure to construct the class of combined ternary subdivision schemes.
e construction procedure of the class of combined subdivision schemes is given below.
Step 1. We define the generalized form of the refinement rules of the CETISS; that is, if we have a shape which is obtained by joining the 2D points q k i,2n+2 : i ∈ Z, then, to refine this shape by CETISS, we use the following refinement rules: and, hence, we get a refined shape by joining the 2D refined points L k+1 i,2n+2 : i ∈ Z, where n r � (n!/r!(n − r)!).
Step 2. By Pitolli [18], ternary B-spline schemes of degree-M can be written as By using (10), we can generalize the refinement rules of the CETASS; that is, if we have a shape which is obtained by joining the 2D points q k i,2n+2 : i ∈ Z, then to refine this shape by CETASS, we use the following refinement rules:  Journal of Mathematics and thus we get a refined shape by joining the 2D refined points S k+1 i,2n+2 : i ∈ Z.

e Graphical Clarification of the Parameters and the Refinement Rules.
In this subsection, we graphically explain the construction of the class of subdivision schemes. For this, we restrict the value of n to be 1. Let q k i+α,4 � q k i+α : α � − 1, 0, 1, 2 be the control points of the polygon q k q k ; then, for n � 1, the class of subdivision schemes (9) gives the following 4-point ternary interpolatory subdivision scheme: Similarly, for n � 1, the class of scheme (11) gives the following 4-point relaxed approximating subdivision scheme: Now, we find the displacement vectors from the refined points defined in (15) to the refined points defined in (16); thus, we have Now, we find the refined points by applying operations 3i+2 and refined points L k+1 3i+α : α � 0, 1, 2, where μ and ] are real numbers. Hence, we get By simplifying (18), we get Scheme (19) is the first member of the class of combined subdivision schemes, that is, 4-point combined subdivision scheme. e graphical sketch of the refined points of (19) is shown in Figure 2. In this figure, green bullets show the points q k i : i ∈ Z, green lines show the polygon q k , red squares show the refined points L k+1 3i+α : α ∈ R, red lines show the refined polygon L k+1 , blue squares show the refined points S k+1 3i+α : α ∈ R, blue lines show the refined polygon S k+1 , black arrows show the displacement vectors, and black solid circles show the refined points q k+1 i,2n+2 � q k+1 i : i ∈ Z.
Remark 1. When μ � ] � 0, the first member of the class of combined subdivision schemes which is defined in (19) reduces to the first member of the CETISS. And when μ � 1 and ] � 0, the first member of the class of combined subdivision schemes which is defined in (19) reduces to the first member of the CETASS.

Analysis of the Class of Combined Subdivision Schemes by Using Mathematical Tools
In this section, we present the characteristics of the class of combined subdivision schemes. We use the mathematical tools to analyze the class of schemes.

Affine Combination of Control Points.
A linear combination in which the sum of coefficients is equal to one is called the affine combination. e necessary condition for the convergence of a subdivision scheme is that each refinement rule of it must be the affine combination of the control points in the previous subdivision step. To check this property for (CSS) a 2n+2 , we prove the following theorem.

Theorem 2.
Each refined point of the (CSS) a 2n+2 at (k + 1)-th subdivision step which is defined in (14) is the affine combination of control points of k-th subdivision step.

Journal of Mathematics
Proof. To prove this theorem, we have to prove that the mask a i,2n+2 : i ∈ Z of (CSS) a 2n+2 satisfies the relation Let us simplify the expressions: We also calculate Hence, to prove that each of the refined points q k+1 3i,2n+2 , q k+1 3i+1,2n+2 , and q k+1 3i+2,2n+2 is the affine combinations of q k i : i ∈ Z , we use (20) and (21). us, which completes the proof.

Support of the Class of Combined Schemes.
In this subsection, we present the support size of the class of combined schemes. e support of a subdivision scheme represents how far one vertex is affected by its neighboring points. Its size represents the local support property of the subdivision curve.  Journal of Mathematics

Theorem 3. e support of the class of subdivision schemes
In order to calculate the support size of (CSS) a 2n+2 , we have to calculate the distance between two corresponding subscripts belonging to the leftmost vertex and rightmost vertex after k-steps of subdivision.
If we operate on initial data q 0 i,2n+2 � q 0 i ∈ R i∈Z by (CSS) a 2n+2 one time, then we get If we operate on the data q 1 i,2n+2 ∈ R i∈Z which is defined in (24) by (CSS) a 2n+2 one time, that is, we operate on initial data q 0 i,2n+2 � q 0 i ∈ R i∈Z by (CSS) a 2n+2 two times, then we get Similarly, if we operate on initial data Hence, after k-steps of subdivision, the leftmost nonzero vertex is q k and the rightmost nonzero vertex . Since k-times, the subdivision process is applied and, at each step, we have relabeled the subscripts of the vertices; thus, Hence, after k-steps, the distance between leftmost and rightmost nonzero vertices is equal to the support of (CSS) a 2n+2 ; that is, Here, φ(z) is the Laurent polynomial with φ(1) � 3 and it does not have the factor (1 + z + z 2 ). Proof.
e Laurent polynomial of (CSS) a 2n+2 is where b 2n+2 (z) is a Laurent polynomial obtained by b 2n+2 (z) � (3a 2n+2 (z)/1 + z + z 2 ). Hence, the degree of polynomial generation of (CSS) a 2n+2 is 2.  (19). From eorem 2, the subdivision scheme which is defined in (14) and denoted by (CSS) a 4 satisfies the necessary conditions for convergence. Moreover, the Laurent polynomial of (CSS) a 4 is By using Laurent polynomial of (CSS) a 4 , we prove the following theorem.
Proof. To prove that (CSS) a 4 produces the C 2 -continuous shapes, first, we have to prove that this scheme produces C 0 -continuous and C 1 -continuous shapes in the given intervals of μ and ].
us, by using (30), we calculate Hence, from the above equation, we have where the subdivision scheme corresponding to the Laurent polynomial a (1) 4 (z) is denoted by (CSS) a (1)
is implies that (CSS) a (1) 4 is contractive and the scheme (CSS) a 4 produces C 0 -continuous shapes. Now, we again calculate where the subdivision scheme corresponding to the Laurent polynomial a (2) 4 (z) is denoted by (CSS) a (2)
is implies that (CSS) a (3) 4 is contractive and hence (CSS) a 4 is C 2 -continuous. is completes the proof.

□
If we put ] � 0 in the Laurent polynomial (30), then it gives one more factor of (1 + z + z 2 ). Hence, the following corollary is proved.

Corollary 2.
e continuity of (CSS) a 4 can be increased if we use the refinement rules corresponding to the following Laurent polynomial which is derived from the Laurent polynomial of (30): Now, here we use the method proposed by Rioul [19] to find out the H€ oölders regularity of (CSS) a 4 . Since where i, j � 1, 2, 3, 4, thus, we have Let ρ(F j ): j � 0, 1, 2, 3, 4 be the joint spectral radii of matrices F 0 , F 1 , F 2 , F 3 , and F 4 , respectively; then, we have e eigenvalues of F 0 , F 1 , F 2 , F 3 , and F 4 are required to calculate their joint spectral radii; therefore, e infinity norm of F 0 , F 1 , F 2 , F 3 , and F 4 is where j � 0, 1, 2, 3, 4.
Proof. To find out the limit stencil of (CSS) a 4 , we substitute i � − 1 and i � 0 in the refinement rules (19) of (CSS) a 4 . Hence, we obtain the following refined points: Symbolically, it can be written as Now we calculate the eigenvalues of the subdivision matrix R 1 and denote them by λ i : i � 0, 1, 2, 3. us, we have Journal of Mathematics e matrix of the eigenvector corresponding to the eigenvalues is By taking the inverse of the above matrix, we get Let δ be the diagonal matrix of eigenvalues; then, Since R 1 � WδW − 1 , therefore R k 1 � Wδ k W − 1 . Also, we have which implies that Hence, us, we have e Laurent polynomial of (CSS) a 6 denoted by a 6 (z) � a (0) 6 (z) is defined:

Theorem 9.
e limit stencil of (CSS) a 6 is

Geometrical Influence of (CSS) a 2n+2 in Curve Modeling
In this section, we present models produced by the new combined 4-point and 6-point subdivision schemes. For modeling of 2D shapes by the combined schemes, we use the procedure which is explained in Figure 3 through a flowchart. is procedure is used in the following numerical examples for curve modeling.
Example 1. In this example, we draw the initial sketch q 0 by using the initial data q 0 i : i ∈ Z . e initial sketch and the initial data are shown by black polygons and red bullets in Curves fitted by the first two members of our class of schemes are shown in Figures 5(b) and 5(d), respectively, and the curves fitted by the first two members of the CETISS are shown in Figures 5(a) and 5(c), respectively. We see that the CETISS produce Gibbs oscillations in the limit curves close to the discontinuity. It is also noted that our combined schemes do not produce Gibbs oscillations in the limit curves for certain values of the shape parameters.
Example 3. In this example, we take the initial data such that if we join this data by straight lines, we get a close polygonal shape. We smooth this shape by the first two members of our class of schemes and results are shown in Figure 6. is figure shows the flexible behaviour of our combined subdivision scheme. It also shows that shape parameters in the combined subdivision schemes provide grip on the limit curves.

Conclusion
In this research, we have constructed and analyzed a class of combined ternary subdivision schemes. e construction procedure is very simple and consists of only a few simple mathematical operations on the refinement rules of the two well-known classes of the schemes. But it gives us amazing results that are discussed theoretically and geometrically in detail. e class of schemes gives good smoothness and local control on the limit shapes. It also provides us a flexible environment to fit curves. e unnecessary oscillations in the limit curves of our combined schemes can be removed by changing the values of the shape parameters.

Data Availability
No datasets were generated or analyzsed during the current study.

Conflicts of Interest
e authors declare that they have no conflicts of interest.