Fractal Behavior of a Ternary 4-Point Rational Interpolation Subdivision Scheme

Abstract

In this paper, a ternary 4-point rational interpolation subdivision scheme is presented, and the necessary and sufficient conditions of the continuity are analyzed. The generalization incorporates existing schemes as special cases: Hassan–Ivrissimtzis’s scheme, Siddiqi–Rehan’s scheme, and Siddiqi–Ahmad’s scheme. Furthermore, the fractal behavior of the scheme is investigated and analyzed, and the range of the parameter of the fractal curve is the neighborhood of the singular point of the rational scheme. When the fractal curve and surface are reconstructed, it is convenient for the selection of parameter values.

1. Introduction

Due to the use of techniques that are simple and easy to handle, the subdivision method is widely used for generating smooth curves from original data points, and this method plays an important role in computer-aided geometric design, computer-aided design, and image processing.

According to the relationship of the original points and the limit curves, the two categories we are going to divide them into are interpolation subdivision [1,2,3,4,5,6] and approximation subdivision [7,8,9,10]. The limit curve of the interpolation subdivision scheme is through all original points, which can protect the shape of the original control polygon. In 2002, Hassan et al. [2] presented a ternary 4-point interpolating subdivision scheme that generates a $C^2$ limiting curve for the tension parameter satisfied with $\frac{1}{15}<\mu <\frac{1}{9}$. In 2010 and 2012, Mustafa et al. [3,4] introduced 6-point and 5-point ternary interpolating schemes with a shape parameter in succession, and proved the limit curves are $C^3$ or $C^2$ and continue for a certain range of parameter $\omega$. In 2012 and 2013, Siddiqi and Rehan [5,6] proposed two schemes of ternary 4-point interpolating subdivision in which the limiting curve is $C^1$ or $C^2$ continuous. The above schemes have the following common characteristics: the masks in the scheme are all simple linear combinations of parameters, and when the limit curve is $C^1$ or $C^2$ continuous, the selection range of parameters is small, so it is impossible to know what will happen to the limit curves at other infinite intervals.

Compared with interpolation subdivision, the limit curve of the approximation subdivision scheme did not continue through the original points, but this scheme had less support and the limit curve had higher smoothness. In 2004, Hassan and Dodgson [7] derived a ternary 3-point approximating subdivision scheme that generates the $C^2$ limiting curve. In 2007, Ko et al. [8] introduced an improved ternary 4-point approximating subdivision scheme derived from cubic polynomial interpolation, and used similar methods to generalize ternary $(2n+2)$ point approximating subdivision schemes. In 2012, Ghaffar and Mustafa [9] investigated a general formula to generate the family of an even-point ternary approximating subdivision scheme with a shape parameter. In 2015, Rehan and Siddiqi [10] proposed a ternary 4-point approximating subdivision scheme that generates the limiting curve of $C^3$ continuity. These experimental results show that when the continuity was higher, the limiting curve of the approximation scheme deviated further from the original points.

This motivated us to present a ternary interpolation scheme with high smoothness and more degrees of freedom for the curve design. The proposed scheme not only provides the mask of 4-point schemes, but also generalizes and unifies several well-known schemes.

Furthermore, the subdivision scheme is important not only in the geometric design of smooth curves, but also in the construction of irregular shapes. Zheng et al. [11,12] proved that the limit curves generated by binary 4-point and ternary 3-point interpolation subdivision schemes are fractals. Siddiqi et al. [13,14] described the fractal behavior of ternary 4-point interpolation subdivision schemes.

In this paper, the fractal behavior of the ternary 4-point rational interpolation subdivision scheme is investigated and analyzed. Through examples, it was found that when the parameter selection is close to the singular point, the limit curve pattern is more turbulent. As the parameter value becomes far from the singular point, the limit curve becomes smoother and finally reaches $C^1$ and $C^2$ continuity.

2. Preliminaries

A general ternary subdivision scheme S with the initial values $p^0={\{p_i^0\}}_{i\in Z}$ recursively defines new discrete values as follows:

$$p_i^{k+1}=\sum _{j\in \mathbb{Z}}{a}_{3j-i}{p}_j^k,i\in \mathbb{Z},$$

(1)

where the set $a=\{a_i|i\in \mathbb{Z}\}$ of coefficients is called the mask of the scheme. A necessary condition for uniform convergence of the subdivision scheme (1) is that

$$\sum _{j\in \mathbb{Z}}{a}_{3j}=\sum _{j\in \mathbb{Z}}{a}_{3j+1}=\sum _{j\in \mathbb{Z}}{a}_{3j+2}=1.$$

(2)

The Z-transform of the mask a of subdivision scheme can be given as

$$a(z)=\sum _{i\in \mathbb{Z}}{a}_i{z}^i,$$

(3)

which is called the symbol or Laurent polynomial.

A subdivision scheme is said to be uniformly convergent if for every initial data $p^0={\{p_i^0\}}_{i\in Z}$, there is a continuous function f such that for any closed interval $[a,b]$

$$\underset{k\to \infty }{lim}\underset{i\in \mathbb{Z}\cap 3^k[a,b]}{sup}|p_i^k-f(\frac{i}{3^k})|=0.$$

As a result, f is regarded as the limit function of the subdivision scheme, and is denoted $f=S^{\infty }{p}^0$.

In 2002, Hassan et al. [2] provided a sufficient and necessary condition for a uniform convergent subdivision scheme. Firstly, they used matrix formalism to derive necessary conditions for a scheme to be $C^k$ based on the eigenvalues of the subdivision matrix. If the limiting curve is $C^2$ continuity, the eigenvalues $\{{\lambda }_i\}$ satisfy:

$${\lambda }_0=1,|{\lambda }_i|>|{\lambda }_{i+1}|,i=1,2,\dots ,and{\lambda }_1^2=|{\lambda }_2|>|{\lambda }_3|.$$

(4)

Secondly, a subdivision scheme S is uniform convergent if and only if there is an integer $L\ge 1$, such that $\parallel {(\frac{1}{3}{S}_1)}^L{\parallel }_{\infty }<1$. Then, the subdivision scheme is uniform convergent.

This paper is organized as follows. In Section 3, a ternary 4-point rational interpolating subdivision scheme is presented. The continuity analyses are in Section 4. In Section 5, the fractal behavior of subdivision schemes is introduced. In Section 6, examples are considered to demonstrate the role of the parameter. Conclusions are drawn in Section 7.

3. Rational Interpolation Subdivision Scheme

A 4-point rational interpolation subdivision scheme is defined as

$$\left\{\begin{array}{c}\hfill p_{3i}^{k+1}=p_i^k,\\ \hfill p_{3i+1}^{k+1}=a_0{p}_{i-1}^k+a_1{p}_i^k+a_2{p}_{i+1}^k+a_3{p}_{i+2}^k,\\ \hfill p_{3i+2}^{k+1}=a_3{p}_{i-1}^k+a_2{p}_i^k+a_1{p}_{i+1}^k+a_0{p}_{i+2}^k,\end{array}\right.$$

(5)

where

$$a_0=\frac{2-243\alpha }{27(126\alpha -1)},a_1=\frac{873\alpha -7}{9(126\alpha -1)},a_2=\frac{129\alpha -1}{3(126\alpha -1)},a_3=\frac{1-135\alpha }{27(126\alpha -1)},and\alpha \ne \frac{1}{126}.$$

Specifically, for $\alpha =\frac{1}{108}$, the mask of the subdivision scheme is:

$$a=\{\cdots ,0,0,-\frac{1}{18},-\frac{1}{18},0,\frac{7}{18},\frac{13}{18},1,\frac{13}{18},\frac{7}{18},0,-\frac{1}{18},-\frac{1}{18},0,0,\cdots \},$$

and this is exactly the scheme which is mentioned in Hassan et al. [2].

For $\alpha =0$, the mask of the subdivision scheme is:

$$a=\{\cdots ,0,0,-\frac{1}{27},-\frac{2}{18},0,\frac{9}{18},\frac{21}{27},1,\frac{21}{27},\frac{9}{18},0,-\frac{2}{18},-\frac{1}{27},0,0,\cdots \},$$

then the subdivision scheme rebuilds the scheme in Siddiqi et al. [5].

For $\alpha =\frac{1}{90}$, it is a ternary 4-point subdivision scheme:

$$a=\{\cdots ,0,0,-\frac{5}{108},-\frac{7}{108},0,\frac{13}{36},\frac{3}{4},1,\frac{3}{4},\frac{13}{36},0,-\frac{7}{108},-\frac{5}{108},0,0,\cdots \},$$

then the subdivision scheme is the scheme offered by Siddiqi et al. [6].

4. Continuity Analysis

4.1. Necessary Condition

Theorem 1.

If the limiting curve of the subdivision scheme (5) is $C^2$ continuity, the parameter $\alpha \in (-\infty ,0)\bigcup (\frac{1}{86},+\infty )$.

Proof. 

Similar to in Hassan’s paper [2], let the matrix A be the mid-point subdivision matrix and the matrix B be the vertex subdivision matrix. We have:

$$A=\left(\begin{array}{cccccc}{a}_3& a_2& a_1& a_0& 0& 0\\ 0& 0& 1& 0& 0& 0\\ 0& a_0& a_1& a_2& a_3& 0\\ 0& a_3& a_2& a_1& a_0& 0\\ 0& 0& 0& 1& 0& 0\\ 0& 0& a_0& a_1& a_2& a_3\end{array}\right),B=\left(\begin{array}{ccccc}{a}_0& a_1& a_2& a_3& 0\\ a_3& a_2& a_1& a_0& 0\\ 0& 0& 1& 0& 0\\ 0& a_3& a_2& a_1& a_0\\ 0& a_0& a_1& a_2& a_3\end{array}\right).$$

• The eigenvalues for A are $1,{\displaystyle \frac{1}{3}},{\displaystyle \frac{1}{9}},{\displaystyle \frac{108\alpha -1}{9(126\alpha -1)}},{\displaystyle \frac{1-135\alpha }{27(126\alpha -1)}},{\displaystyle \frac{1-135\alpha }{27(126\alpha -1)}}.$
• The eigenvalues for B are $1,{\displaystyle \frac{1}{3}},{\displaystyle \frac{1}{9}},{\displaystyle \frac{297\alpha -2}{27(126\alpha -1)}},{\displaystyle \frac{\alpha }{126\alpha -1}}.$

From the two subdivision matrices and Equation (4), we can find the bound of $\alpha$ which is a necessary condition of the limiting curve to be $C^2$ continuity.

If the eigenvalues of the mid-point subdivision matrix satisfy the necessary conditions (4), then

$$\frac{1}{9}>\left|\frac{108\alpha -1}{9(126\alpha -1)}\right|>\left|\frac{1-135\alpha }{27(126\alpha -1)}\right|.$$

(6)

If the eigenvalues of vertex subdivision matrix satisfies the necessary conditions (4), then

$$\frac{1}{9}>\left|\frac{297\alpha -2}{27(126\alpha -1)}\right|>\left|\frac{\alpha }{126\alpha -1}\right|.$$

(7)

Combining Equation (6) and Equation (7), we find that the necessary conditions for $C^2$ continuity are $\alpha \in (-\infty ,0)\bigcup (\frac{1}{86},+\infty )$. □

4.2. Sufficient Condition

Theorem 2.

If $\alpha \in (-\infty ,0)\bigcup (\frac{1}{86},+\infty )$, then the subdivision scheme of Equation (5) is $C^2$ continuity.

Proof. 

Considering the refinement rules of the ternary 4-point rational interpolating subdivision scheme defined in Equation (5), we calculate sufficient conditions for the continuity of $C^0$, $C^1$, and $C^2$ by the Laurent polynomial method.

The mask a of the subdivision scheme can be written as

$$a=\frac{1}{126\alpha -1}\{\frac{1-135\alpha }{27},\frac{2-243\alpha }{27},0,\frac{873\alpha -7}{9},\frac{129\alpha -1}{3},1,\frac{129\alpha -1}{3},\frac{873\alpha -7}{9}$$

$$\frac{873\alpha -7}{9},0,\frac{2-243\alpha }{27},\frac{1-135\alpha }{27}\}.$$

(8)

Taking $a_m(z)={(\frac{3z^2}{1+z+z^2})}^{m}a(z)$, we have:

$$\begin{gathered} a_1(z)=\frac{1}{9(126\alpha -1)}\{(1-135\alpha )z^{-3}+(243\alpha -2)z^{-2}+(1-108\alpha )z^{-1}+(1026\alpha -8) \\ +(1350\alpha -11)z+(1026\alpha -8)z^2+(1-108\alpha )z^3+(243\alpha -2)z^4+(1-135\alpha )z^5\}, \end{gathered}$$

for the range $\alpha \in (-\infty ,0)\bigcup (\frac{1}{86},+\infty )$,

$${∥\frac{1}{3}{S}_1∥}_{\infty }=\frac{1}{3}max\{\sum _{i\in \mathbb{Z}}{a}_{3i}^{(1)},\sum _{i\in \mathbb{Z}}{a}_{3i+1}^{(1)},\sum _{i\in \mathbb{Z}}{a}_{3i+2}^{(1)}\}=\left|\frac{15-1521\alpha }{27(1-126\alpha )}\right|<1.$$

(9)

$$\begin{gathered} a_2(z)=\frac{1}{3(126\alpha -1)}\{(1-135\alpha )z^{-1}-27\alpha +(351\alpha -1)z+(648\alpha -5)z^2+(351\alpha -1)z^3 \\ -27\alpha z^4+(1-135\alpha )z^5\}, \end{gathered}$$

for the range $\alpha \in (-\infty ,0)\bigcup (\frac{1}{86},+\infty )$,

$${∥\frac{1}{3}{S}_2∥}_{\infty }=\frac{1}{3}max\{\sum _{i\in \mathbb{Z}}{a}_{3i}^{(2)},\sum _{i\in \mathbb{Z}}{a}_{3i+1}^{(2)},\sum _{i\in \mathbb{Z}}{a}_{3i+2}^{(2)}\}=\left|\frac{7-918\alpha }{9(1-126\alpha )}\right|<1.$$

(10)

$$a_3(z)=\frac{1}{126\alpha -1}\{(1-135\alpha )z+(162\alpha -1)z^2+(324\alpha -3)z^3+(162\alpha -1)z^4+(1-135\alpha )z^5\},$$

for the range $\alpha \in (-\infty ,0)\bigcup (\frac{1}{86},+\infty )$,

$${∥\frac{1}{3}{S}_3∥}_{\infty }=\frac{1}{3}max\{\sum _{i\in \mathbb{Z}}{a}_{3i}^{(3)},\sum _{i\in \mathbb{Z}}{a}_{3i+1}^{(3)},\sum _{i\in \mathbb{Z}}{a}_{3i+2}^{(3)}\}=\left|\frac{3-324\alpha }{3(1-126\alpha )}\right|<1.$$

(11)

According to (9), (10), and (11), we know that the sufficient conditions are satisfied for this scheme to be $C^0$, $C^1$, and $C^2$. □

5. Fractal Behavior

In this paper, the fractal behavior of a ternary 4-point interpolation subdivision scheme is developed and analyzed.

The original data points are $p^0={\{p_i^0\}}_{i=0}^n$. Let $p^k={\{p_i^k\}}_{i=0}^{3^{k}n+1}$ be the set of control points at level k, and $p^k={\{p_i^k\}}_{i=0}^{3^{k}n+1}$ satisfies the scheme (5). We need to analyze the effect of the parameter $\alpha$ on the sum of the length of all the small edges between two arbitrary fixed control points $p_i^k$ and $p_j^k$ after k subdivision steps. For simplicity, we only analyze the effect between two initial points $p_0^0$ and $p_1^0$ .

According to the subdivision scheme (5), it is known that $p_0^k=p_0^0$, where $k\ge 0$ and:

$$\left\{\begin{array}{c}\hfill p_0^{k+1}=p_0^k,\\ \hfill p_1^{k+1}=a_0{p}_{-1}^k+a_1{p}_0^k+a_2{p}_1^k+a_3{p}_2^k,\\ \hfill p_2^{k+1}=a_3{p}_{-1}^k+a_2{p}_0^k+a_1{p}_1^k+a_0{p}_2^k.\end{array}\right.$$

We defined the three edge vectors as:

$$\begin{array}{c}\hfill \left\{\begin{array}{c}\hfill V_k=p_1^k-p_0^k,\\ \hfill S_k=p_2^k-p_1^k,\\ \hfill R_k=p_3^k-p_2^k.\end{array}\right.\end{array}$$

(12)

Let $U_k=p_1^k-p_{-1}^k$, $W_k=p_0^k-p_{-1}^k$ and $Z_k=p_2^k-p_{-2}^k$, and we can get $U_k=V_k+W_k$. Since $U_k=p_1^k-p_{-1}^k$, $U_k$ can be written as:

$$U_{k+1}=(a_2-a_0)U_k+a_3{Z}_k.$$

(13)

Similarly:

$$Z_{k+1}=(a_1-a_3)Z_k+a_0{U}_k.$$

(14)

Equations (13) and (14) are non-homogeneous difference equations to be solved simultaneously. Since

$$U_0=p_1^0-p_{-1}^0,$$

$$U_1=p_1^1-p_{-1}^1=-a_3{p}_{-2}^0+(a_0-a_2)p_{-1}^0+(a_2-a_0)p_1^0+a_3{p}_2^0$$

gives the special solution:

$$U_k=C_1{\lambda }_1+C_2{\lambda }_2,$$

(15)

where ${\lambda }_1=\frac{1}{3}$, ${\lambda }_2=\frac{\alpha }{126\alpha -1}$, and

$$C_1=\frac{(135\alpha -1)p_{-2}^0-(4806\alpha -38)p_{-1}^0+(4806\alpha -38)p_1^0+(1-135\alpha )p_2^0}{9-1161\alpha },$$

$$C_2=\frac{(1026\alpha -8)p_{-2}^0+(3649\alpha -29)p_{-1}^0+(4806\alpha -38)p_1^0+(1-135\alpha )p_2^0}{1161\alpha -9}.$$

Since $V_k=p_1^k-p_0^k$ and $S_k=p_2^k-p_1^k$, it follows that

$$V_{k+1}=(1-a_1)V_k+a_3{S}_k-a_0{U}_k,$$

(16)

$$S_{k+1}=(a_0-a_3)S_k+(a_1-a_2)V_k+(a_0-a_3)U_k,$$

(17)

$$R_{k+1}=-a_0{V}_k+a_2{S}_k+a_3{U}_k.$$

(18)

Using Equations (15), (16), and (17), yields:

$$V_{k+2}=(1+a_0-a_1-a_3)V_{k+1}+[a_3(a_1-a_2)-(1-a_1)(a_0-a_3)]V_k+U_k,$$

(19)

or

$$\frac{243(126\alpha -1)}{108\alpha -1}{V}_{k+2}=\frac{45(135\alpha -1)}{108\alpha -1}{V}_{k+1}+\frac{2-197\alpha }{108\alpha -1}{V}_k+U_k,$$

(20)

and the corresponding characteristic equation is:

$$\frac{243(126\alpha -1)}{108\alpha -1}{r}^2-\frac{45(1-135\alpha )}{108\alpha -1}r-\frac{197\alpha -2}{108\alpha -1}=0.$$

(21)

When $\alpha \ne \frac{1}{108}$ , the roots of (21) are $r_1=\frac{1}{9}$, $r_2=\frac{297\alpha -2}{27(126\alpha -1)}$, and the solution of Equation (16) is

$$V_k=D_1{r}_1^k+D_2{r}_2^k+D_3{\lambda }_1^k+D_4{\lambda }_2^k,$$

(22)

where $D_i,i=1,2,3,4$ are the linear combinations of ${\{p_i^0\}}_{i=-2}^2$.

Similarly, the solution of Equation (17) is:

$$S_k=E_1{\rho }_1^k+E_2{r}_1^k+E_3{r}_2^k+E_4{\lambda }_1^k+E_5{\lambda }_2^k,$$

(23)

where ${\rho }_1=\frac{108\alpha -1}{27(126\alpha -1)}$ and $E_i,i=1,\dots ,5$ are the linear combinations of ${\{p_i^0\}}_{i=-2}^2$.

The solution of Equation (18) is:

$$R_k=H_1{\rho }_1^k+H_2{r}_1^k+H_3{r}_2^k+H_4{\lambda }_1^k+H_5{\lambda }_2^k,$$

(24)

where $H_i,i=1,\dots ,5$ are the linear combinations of ${\{p_i^0\}}_{i=-2}^2$.

Theorem 3.

If $\alpha \in (\frac{11}{1431},\frac{7}{837})$ and $\alpha \ne \frac{1}{126}$, then the limit curve of the subdivision scheme (5) is a fractal curve.

Proof. 

From Equations (22), (23), and (24), it might be concluded by induction that $3^k$ small edge vectors between the two initial control points $p_i^k$ and $p_j^k$ after k subdivision steps can be expressed as

$${\omega }_i^k=p_i^k-p_{i-1}^k={\mu }_{1i}{\rho }_1^k+{\mu }_{2i}{r}_1^k+{\mu }_{3i}{r}_2^k+{\mu }_{4i}{\lambda }_1^k+{\mu }_{5i}{\lambda }_2^k,i=1,2,3.$$

(25)

For $\alpha \in (\frac{11}{1431},\frac{7}{837})$ and $\alpha \ne \frac{1}{126}$, then

$$\left|r_2\right|>\frac{1}{9}=r_1,\left|r_1\right|>\left|{\rho }_1\right|,\left|r_2\right|>\frac{1}{3}={\lambda }_1,\left|r_2\right|>\left|{\lambda }_2\right|.$$

(26)

Let $\left|{\omega }_i^k\right|$ refer to the length of a vector ${\omega }_i^k$ and $\left|{\omega }_{i0}^k\right|={min}_{i=1,2,\cdots ,3^k}\left|{\omega }_i^k\right|$. Then, we have

$$\begin{gathered} \sum _{i=1}^{3k}\left|{\omega }_i^k\right|=3^k\left|{\mu }_{1i}{\rho }_1^k+{\mu }_{2i}{r}_1^k+{\mu }_{3i}{r}_2^k+{\mu }_{4i}{\lambda }_1^k+{\mu }_{5i}{\lambda }_2^k\right| \\ ={\left|3\times \frac{297\alpha -7}{27(126\alpha -1)}\right|}^k·\left|{\mu }_{1i}{\left(\frac{{\rho }_1}{r_2}\right)}^k+{\mu }_{2i}{\left(\frac{r_1}{r_2}\right)}^k+{\mu }_{3i}+{\mu }_{4i}{\left(\frac{{\lambda }_1}{r_2}\right)}^k+{\mu }_{5i}{\left(\frac{{\lambda }_2}{r_2}\right)}^k\right|\to \infty (k\to \infty ). \end{gathered}$$

Hence, so far as the initial points $p_0^0$ and $p_1^0$ are concerned, the sum of the lengths of all the small edges tends to infinity as k approaches infinity. Therefore, the limit curve of ternary 4-point scheme is a fractal curve when $\alpha \in (\frac{11}{1431},\frac{7}{837})$ and $\alpha \ne \frac{1}{126}$, and this parameter is valued near the point $\frac{1}{126}$. □

We give the comparison of the range for continuity and fractal behavior of proposed 4-point ternary scheme with other existing ternary schemes in

Table 1. Comparison of existing ternary 4-point interpolation subdivision schemes.

Scheme	Continuity	The Range for ${\mathit{C}}^{\mathit{k}}$	The Range for Fractal Behavior
Hassan [2]	$C^2$	$(\frac{1}{15},\frac{1}{9})$	$(-1,-\frac{1}{5})\bigcup (\frac{3}{5},1)\mathrm{Siddiqi}$ [13]
Siddiqi [6]	$C^1$	$(-\frac{1}{18},\frac{1}{9})$	$(-\frac{17}{27},-\frac{1}{3})\mathrm{Siddiqi}$ [14]
Ours	$C^2$	$(-\infty ,0)\bigcup (\frac{1}{84},+\infty )$	$(\frac{11}{1431},\frac{7}{837})$

.

6. Example

Examples of the rational interpolation subdivision schemes with $C^2$ continuity are given in Figure 1.

Examples of the subdivision schemes with fractal behavior are given in Figure 2.

The change of the limit curves of the subdivision scheme is given in Figure 3.

The application of the fractal curve is given in Figure 4.

The continuous surface and the fractal surface is given in Figure 5.

7. Conclusions

In this paper, a ternary 4-point interpolating subdivision scheme is introduced which generates a family of $C^2$ limiting curves for the range of parameter $\alpha \in \left(-\infty ,0\right)\bigcup \left(\frac{1}{84},+\infty \right)$. Compared with Hassan et al. [2] and Siddiqi et al. [6], the advantage of the proposed subdivision scheme is that it generates smooth limiting curves of $C^2$ continuity for a wider range of the parameter. The Laurent polynomial method and matrix method are used to prove the smoothness of the proposed subdivision scheme. Furthermore, the fractal behavior of the subdivision scheme was analyzed, along with the range of parameter $\alpha \in (\frac{11}{1431},\frac{7}{837})$.