Unified Framework of Approximating and Interpolatory Subdivision Schemes for Construction of Class of Binary Subdivision Schemes

Ashraf, Pakeeza; Mustafa, Ghulam; Ghaffar, Abdul; Zahra, Rida; Nisar, Kottakkaran Sooppy; Mahmoud, Emad E.; Alharbi, Wedad R.

doi:https://doi.org/10.1155/2020/6677778

Journal of Function Spaces

On this page

Abstract Introduction Preliminaries Conclusion Data Availability Conflicts of Interest Authors’ Contributions Acknowledgments References Copyright Related Articles

Special Issue

Approximation Methods: Theory and Applications

View this Special Issue

Research Article | Open Access

Volume 2020 | Article ID 6677778 | https://doi.org/10.1155/2020/6677778

Unified Framework of Approximating and Interpolatory Subdivision Schemes for Construction of Class of Binary Subdivision Schemes

Pakeeza Ashraf,¹Ghulam Mustafa,²Abdul Ghaffar,^3,4Rida Zahra,²Kottakkaran Sooppy Nisar,⁵Emad E. Mahmoud,^6,7and Wedad R. Alharbi⁸

Academic Editor: Ali Aral

Received03 Nov 2020

Revised25 Nov 2020

Accepted01 Dec 2020

Published17 Dec 2020

Abstract

In this paper, a generalized algorithm to develop a class of approximating binary subdivision schemes is presented. The proposed algorithm is based on three-point approximating binary and four-point interpolating binary subdivision schemes. It contains a parameter which classifies members of the new class of subdivision schemes. A set of efficient properties, for instance, polynomial generation and reproduction, support, continuity, and Hölder continuity, is discussed. Moreover, applications of the proposed subdivision schemes are given in order to demonstrate their variety, flexibility, and visual performance.

1. Introduction

Subdivision is a competent way of producing smooth curves or surfaces in geometric modeling and computer graphics. It repeatedly refines the initial polygonal shape. After each split average step, we get closer to the limit curve, which is the limit of an infinite series. A nice property of subdivision schemes is that they are simple and local, which means that local change in initial data will only have a local effect in the resulting object. Subdivision schemes have become celebrated because of their simplicity and efficiency. There are generally two main categories of subdivision schemes: interpolatory and approximating. For interpolating subdivision schemes, limit curve always passes through initial control points while for approximating subdivision schemes it may or may not. Subdivision schemes play an integral role in computer graphics due to their wide range of applications in many fields such as engineering, medical science, space science, graphic visualization, and image processing. Differential equations are used for mathematical modeling of many phenomena. Different techniques are being used to solve boundary value problems [1] and nonlinear problems [2]. Nowadays, subdivision schemes are also becoming a popular tool to numerically solve boundary value problems [3]. Subdivision algorithms are also a major field in many multiscale techniques applied in data compression. In some applications, the given data need not be reproduced at each step of the subdivision process, which needs the applications of subdivision schemes. Several researchers in the area of continuous geometry have been established classical subdivision schemes for various kinds of initial control data. In geometric modeling and engineering, practical applications of subdivision curves are restricted due to their shortcomings, and to overcome these shortcomings, a lot of work has been carried out [4–17].

Deslauriers and Dubuc [18] presented a family of interpolating binary subdivision schemes. They used Lagrange interpolating polynomial for construction of schemes. Horman and Sabin (HS) [19] proposed a family of binary subdivision schemes having cubic precision. Some members of the HS family are interpolating and some are approximating. Mustafa et al. [20] offered a family of binary subdivision schemes which has alternating primal and dual symbols. Ashraf et al. [21] discussed a family of binary subdivision schemes based on Lane-Riesenfeld algorithm. Members of the proposed family have quintic precision. Mustafa and Bari [22] developed a family of univariate subdivision schemes for curve generation and data fitting. Asghar and Mustafa [23] presented a unified framework of stationary and nonstationary subdivision schemes. Keeping in view this practice, we present a generalized algorithm to develop a new class of approximating binary subdivision schemes. Ghaffar et al. [24–29] constructed geometric continuity conditions for the construction of free-form generalized subdivision curves with single shape parameter. These free-form complex shape adjustable generalized curves can be obtained by using shape-adjustable generalized subdivision schemes. These newly proposed approaches not only take over the benefits of classical subdivision curve and surface schemes but also resolve the issue of shape adjustability of subdivision curves and surfaces with the help of tension control shape parameters. They modeled some complex curves and surfaces using higher continuity conditions. The proposed masks of the schemes provide an alternative approach to generate the complex curves using higher continuity conditions with simple and straightforward calculation for the proposed algorithm because they are blended with linear polynomials rather than trigonometric functions. In 2020, Ashraf et al. [17, 30, 31] proposed a new approach using the generalized hybrid subdivision curve with shape parameters to solve the problem in construction of some symmetric curves and surfaces. These curves are easily modified by the changing the values of shape parameters.

In this paper, we offer a Lane-Riesenfeld-like algorithm to derive a class of binary approximating subdivision schemes. Our algorithm is based on the well-known four-point interpolating binary subdivision scheme [18], which is continuous, and three-point approximating binary subdivision scheme [32], which has continuity. Considering smoothing stages as in the Lane-Riesenfeld algorithm, our proposed algorithm allows us to derive a class of univariate subdivision schemes. In fact, each member of the proposed class is enumerated by , and higher values of give schemes with wider masks and support, higher continuity, higher Holder regularity, and higher degree of polynomial generation. The first member of the proposed class (corresponding to ) coincides with the three-point approximating binary subdivision scheme [32]. The proposed class of schemes generates schemes of higher continuities and visually more smooth limit curves as compared to existing families of schemes. The content of the paper is structured as follows. In Section 2, fundamental definitions and concepts are given. Section 3 presents a generalized algorithm for construction of new class of subdivision schemes. Section 4 is devoted for properties of proposed schemes, such as continuity, Hölder continuity, and support of basic limit function. Geometrical analysis and some beautiful examples of limit curve are given in Section 5. Section 6 presents a summary of the paper.

2. Preliminaries

Let the initial data be given by a set of control points , and the set of control points at refinement level is given by . Define recursively by the following binary refinement rules: where the finite set is called mask. The recursive algorithm associated with the repeated application of (1) is called subdivision scheme and denoted by . The Laurent polynomial or symbol of the scheme is defined as

Theorem 1 (see [33]). If a binary scheme is convergent, then the mask satisfies The symbol of a convergent scheme can be also be written as with and .

Theorem 2 (see [33]). A binary scheme associated with the symbol is said to be continuous if the subdivision scheme associated with the symbol is contractive.

Proposition 3 (see [34]). A binary scheme generates polynomials of degree if and only if

Proposition 4 (see [34]). A binary scheme reproduces polynomials of degree with respect to parametrization with , if and only if it generates polynomials of degree and

3. Algorithm for Construction of Schemes

The well-known four-point interpolating binary subdivision scheme [18] is given by

By considering (4), the symbol of the even part of scheme (8) is as follows:

Now, consider the three-point approximating binary subdivision scheme [32]

The symbol of scheme (10) is given by

Let us now present the class of subdivision schemes, namely, . The symbol of the scheme is obtained by applying symbol of the even part of scheme (8) -times on symbol of scheme (10) and given by

So by (9), (11), and (12), we have where . The members of the class of subdivision schemes can be categorized by varying in (13). By taking in (13), we get three-point approximating binary scheme [32]. Table 1 presents mask of some members of the proposed class.

4. Properties of the Proposed Schemes

In this section, we present some desirable properties of class of subdivision schemes, comprising of polynomial generation and reproduction, support, continuity, and Hölder continuity.

4.1. Polynomial Generation and Reproduction

If a subdivision scheme generates polynomials of degree up to , then the polynomial generation degree of the scheme is . Also, if the initial data is sampled from a polynomial of degree and the scheme yields precisely the same polynomial in the limit, then the reproduction degree is the maximal degree of polynomials that can be reproduced by the scheme. Clearly, the reproduction degree is always less than or equal to the generation degree. Now, we establish few results about polynomial generation and polynomial reproduction of the proposed subdivision schemes.

Proposition 5. -scheme generates space of polynomials up to degree .

Proof. Since symbol of -scheme satisfies the conditions so by Proposition 3, -scheme has polynomial generation degree.

In the view of Conti and Hormann [35], the standard parametrization at level is not appropriate to analyze a subdivision scheme to reproduce space of polynomials, and the relative shift between the parameterizations at iteration level and is important for polynomial reproduction of degree . By applying a more suitable parametrization with shift parameter , we have the following result.

Proposition 6. -scheme reproduces linear polynomial with respect to parametrization with shift .

Proof. It can be easily verified that Thus, by Propositions 4 and 5, -scheme reproduces polynomial of degree one.

Table 2 presents the degree of polynomial generation and reproduction of some of the proposed -schemes. It is observed that the degree of polynomial generation is increasing linearly with the value of parameter .

4.2. Support

The support of a subdivision scheme quantifies how much one vertex brought change in its neighboring vertices, and its measure represents local support of the limit curve. Basic limit function (BLF) of a convergent subdivision scheme is a limit function of the initial data which is of the form

By following [36], we determine that support of BLF of -scheme is . BLF generated by the proposed and schemes are demonstrated in Figure 1.

(a)

(b)

4.3. Continuity Analysis

Continuity of a subdivision scheme is an essential parameter on which efficiency of a scheme depends. To investigate continuity of our proposed class, we follow the approach as given in [33] and use the symbol of -scheme.

Theorem 7. The -scheme has continuity, where and (floor function).

Proof. The symbol of -scheme (13) can be simplified as with where
Let be the subdivision scheme associated with the symbol . The scheme is contractive provided that . So, by Theorem 2, -scheme has continuity.
In Theorem 7, we discuss continuity of -scheme for . It is to be noted that -scheme has continuity which is analyzed in [32].

Corollary 8. The -scheme has continuity.

Proof. By letting , the symbol of -scheme from (17) and (18) is given by with Let be the scheme corresponding to the symbol . The scheme is contractive, as . So, by Theorem 7, -scheme has continuity.

Similarly, for different values of parameter , continuity of -scheme can be easily computed by using Theorem 7.

4.4. Hölder Continuity Analysis

Continuity of a subdivision scheme is related to the existence of derivative of subdivision curve. For example, subdivision curve is said to be continuous if the derivative of the curve exists and is continuous everywhere in the given interval. On the other hand, Hölder continuity (HC) of a subdivision scheme tells how continuous the highest continuous derivative is. Therefore, it is also important to find HC of subdivision schemes along with continuity. Lower bound (LB) on HC of the proposed class is calculated by using an interesting property of symbol of -scheme, i.e., odd coefficients in are nonnegative and even coefficients are nonpositive.

Theorem 9. LB on the HC of -scheme is , where .

Proof. By (13), symbol of -scheme can be expressed as where , , and . So LB on HC of -scheme is given by . As we know , where is the sum of odd and is the sum of even coefficients of . We can write coefficients of in the following manner: Thus, we have By eigenvalue decomposition, we have which implies that Thus, we have Consequently, LB on HC of -scheme is , where .
Upper bound (UB) on HC of -scheme is as follows.

Theorem 10. UB on HC of -scheme is , where and be the joint spectral radius of the matrices and which are obtained by using symbol of -scheme.

Proof. By (13), symbol of -scheme can be expressed as where . Let be the nonzero real coefficients of . Also, and are the matrices of order defined by where
Let us denote joint spectral radius of both matrices and by . Then, by Rioul [37] and Dyn [33], UB on HC of -scheme is given by .

For different values of parameter , upper and lower bounds on the HC of -schemes can be straightforwardly computed by using Theorems 9 and 10. Table 2 summarizes the continuity and HC of the proposed class of subdivision schemes. It clearly indicates that as we go up for higher values of parameter , continuity and HC of -schemes also increase. Moreover, newly generated -schemes have higher order of continuity and HC as compared to their parent subdivision schemes.

5. Geometrical Analysis of Proposed Schemes

The shape of an object is generally controlled by a control polygon. The purpose of applying a subdivision scheme on the control polygon is to generate visually smooth curves. Figure 2 presents the behavior of some of the proposed schemes. , , and schemes are applied on the same initial polygon, and limit curves are obtained after three iterations. It is evident that the proposed class offers more choices to meet different designing needs.

5.1. Subdivision Rules for Endpoints

For closed curves, the subdivision rules of , , , and schemes can be defined by their corresponding Laurent polynomial from (13). The limit curves generated by these schemes are , , , and continuous, respectively. In case of dealing with open polygons, these rules can be used to improve the interior of the curve, while it is quite troublesome to improve the first and last edges with the help of subdivision rules of the original proposed schemes. So to handle the endpoints of an open polygon, we need to supply additional points which are not usually required in case of a closed polygon. Let be the first edge of the open polygon . Now, we define an additional control point , as an extrapolatory rule in the nonrefined polygon , and then we can compute the point through the proposed schemes by applying subdivision to the subpolygon . We select the point as . The first edge of an open control polygon can be refined by using the following rules. (i)Refinement rules of the proposed three-point scheme are given by (ii)Refinement rules of the proposed five-point scheme are given by (iii)Refinement rules of the proposed six-point scheme are given by (iv)Refinement rules of the proposed eight-point scheme are given by

Similarly, we can refine the final edges of the open polygon.

5.2. Applications and Comparison

Geometrical performance of , , , and schemes is depicted through several examples. The proposed schemes have good continuity and present smooth limit curves. Figures 3(a) and 4(a) present initial control polygons of cap and elephant, respectively, while Figures 3(b) and 4(b) are the limit curves obtained by applying three iterations of -scheme on these initial polygons. Figures 5(a) and 6(a) present initial control polygons of flower and bird, respectively, while Figures 5(b) and 6(b) are the limit curves obtained by applying three iterations of -scheme on these initial polygons. Figures 7(a) and 8(a) present initial control polygons of face of girls, while Figures 7(b) and 8(b) are the limit curves obtained by applying three iterations of -scheme on these initial polygons, respectively.

(a)

(b)

(a)

(b)

(a)

(b)

(a)

(b)

(a)

(b)

(a)

(b)

Figure 9 represents the initial polygon along with sharp features of limit curve generated by -scheme at the third subdivision level. Figures 10 and 11 present comparison of some existing subdivision schemes (3-point scheme [38], 4-point scheme [18], and 5-point scheme [19]) with the proposed subdivision schemes (, , and schemes). We have chosen two different initial polygons, and limit curves are generated after three subdivision levels. It is clear from the figures that the proposed schemes generate smooth limit curves.

(a)

(b)

(a) 3-point scheme [38]

(b) 4-point scheme [18]

(c) 5-point scheme [19]

(d) -scheme

(e) -scheme

(f) -scheme

(a) 3-point scheme [38]

(b) 4-point scheme [18]

(c) 5-point scheme [19]

(d) -scheme

(e) -scheme

(f) -scheme

6. Conclusion

Subdivision is an efficient way of constructing smooth curves or surfaces in geometric modeling and computer graphics. In this paper, we have presented an elegant way of constructing a class of approximating binary subdivision schemes by using two well-known binary subdivision schemes. Several examples are provided to illustrate that the proposed schemes give wide choice to geometric designers for generation of smooth geometric models as per their own needs. Comparison with some existing schemes is also given. Moreover, several important properties like polynomial reproduction and generation, support of BLF, continuity, and HC of the proposed scheme are discussed. Geometrical analysis of the limit curve is also carried out.

Data Availability

No data were used in this study.

Conflicts of Interest

The authors declare that they have no competing interests.

Authors’ Contributions

All the authors contributed equally, and they read and approved the final manuscript for publication.

Acknowledgments

Taif University Researchers Supporting Project number (TURSP-2020/20), Taif University, Taif, Saudi Arabia.

References

M. Shakeel, I. Hussain, H. Ahmad, I. Ahmad, P. Thounthong, and Y. F. Zhang, “Meshless technique for the solution of time-fractional partial differential equations having real-world applications,” Journal of Function Spaces, vol. 2020, Article ID 8898309, 17 pages, 2020.
View at: Publisher Site | Google Scholar
S. Khaldi, R. Mecheraoui, and A. Mukheimer, “A nonlinear fractional problem with mixed Volterra-Fredholm integro-differential equation: existence, uniqueness, H-U-R stability, and regularity of solutions,” Journal of Function Spaces, vol. 2020, Article ID 4237680, 14 pages, 2020.
View at: Publisher Site | Google Scholar
G. Mustafa, S. T. Ejaz, D. Baleanu, A. Ghaffar, and K. S. Nisar, “A subdivision-based approach for singularly perturbed boundary value problem,” Advances in Difference Equations, vol. 1, 20 pages, 2020.
View at: Google Scholar
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.
View at: Publisher Site | Google Scholar
B.-j. Li, Z.-l. Yu, B.-w. Yu, S. U. Zhi-xun, and X.-p. Liu, “Non-stationary subdivision for exponential polynomials reproduction,” Acta Mathematicae Applicatae Sinica, English Series, vol. 29, no. 3, pp. 567–578, 2013.
View at: Publisher Site | Google Scholar
G. Mustafa, F. Khan, and A. Ghaffar, “The m-point approximating subdivision scheme,” Lobachevskii Journal of Mathematics, vol. 30, no. 2, pp. 138–145, 2009.
View at: Publisher Site | Google Scholar
G. Mustafa, A. Ghaffar, and F. Khan, “The odd-point ternary approximating schemes,” American Journal of Computational Mathematics, vol. 1, no. 2, pp. 111–118, 2011.
View at: Publisher Site | Google Scholar
W. Salam, S. S. Siddiqi, and K. Rehan, “Chaikin’s perturbation subdivision scheme in non-stationary forms,” Alexandria Engineering Journal, vol. 55, no. 3, pp. 2855–2862, 2016.
View at: Publisher Site | Google Scholar
S. S. Siddiqi and M. Younis, “Ternary approximating non-stationary subdivision schemes for curve design,” Central European Journal of Engineering, vol. 4, pp. 371–378, 2014.
View at: Google Scholar
S. S. Siddiqi and N. Ahmad, “An approximating stationary subdivision scheme,” European Journal of Scientific Research, vol. 15, pp. 97–102, 2006.
View at: Google Scholar
A. Shahzad, F. Khan, A. Ghaffar, G. Mustafa, K. S. Nisar, and D. Baleanu, “A novel numerical algorithm to estimate the subdivision depth of binary subdivision schemes,” Symmetry, vol. 12, no. 1, p. 66, 2020.
View at: Publisher Site | Google Scholar
S. M. Hussain, A. U. Rehman, D. Baleanu, K. S. Nisar, A. Ghaffar, and S. A. Abdul Karim, “Generalized 5-point approximating subdivision scheme of varying arity,” Mathematics, vol. 8, no. 4, p. 474, 2020.
View at: Publisher Site | Google Scholar
X. Song, M. Aigner, F. Chen, and B. Jüttler, “Circular spline fitting using an evolution process,” Journal of Computational and Applied Mathematics, vol. 231, no. 1, pp. 423–433, 2009.
View at: Publisher Site | Google Scholar
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.
View at: Publisher Site | Google Scholar
J. Wallner and N. Dyn, “Convergence and analysis of subdivision schemes on manifolds by proximity,” Computer Aided Geometric Design, vol. 22, pp. 593–622, 2005.
View at: Google Scholar
L. Zhang, H. Ma, S. Tang, and J. Tan, “A combined approximating and interpolating ternary 4-point subdivision scheme,” Journal of Computational and Applied Mathematics, vol. 350, pp. 37–49, 2018.
View at: Google Scholar
P. Ashraf, A. Ghaffar, D. Baleanu, I. Sehar, K. S. Nisar, and F. Khan, “Shape-preserving properties of a relaxed four-point interpolating subdivision scheme,” Mathematics, vol. 8, no. 5, p. 806, 2020.
View at: Publisher Site | Google Scholar
G. Deslauriers and S. Dubuc, “Symmetric iterative interpolation processe,” Constructive Approximation, vol. 5, no. 5, pp. 49–68, 1989.
View at: Google Scholar
K. Hormann and M. A. Sabin, “A family of subdivision schemes with cubic precision,” Computer Aided Geometric Design, vol. 25, no. 1, pp. 41–52, 2008.
View at: Publisher Site | Google Scholar
G. Mustafa, P. Ashraf, and M. Aslam, “Binary univariate dual and primal subdivision schemes,” SeMA Journal, vol. 65, no. 1, pp. 23–35, 2014.
View at: Publisher Site | Google Scholar
P. Ashraf, G. Mustafa, and J. Deng, “A six-point variant on the Lane-Riesenfeld algorithm,” Journal of Applied Mathematics, vol. 2014, Article ID 628285, 7 pages, 2014.
View at: Publisher Site | Google Scholar
G. Mustafa and M. Bari, “Wide-ranging families of subdivision schemes for fitting data,” Punjab University Journal of Mathematics, vol. 48, no. 2, pp. 125–134, 2016.
View at: Google Scholar
M. Asghar and G. Mustafa, “Stationary and non-stationary univariate subdivision schemes,” Punjab University Journal of Mathematics, vol. 50, no. 3, pp. 25–42, 2018.
View at: Google Scholar
A. Ghaffar, G. Mustafa, and K. Qin, “Unification and application of 3-point approximating subdivision schemes of varying arity,” Open Journal of Applied Sciences, vol. 2, no. 4, pp. 48–52, 2012.
View at: Publisher Site | Google Scholar
A. Ghaffar, G. Mustafa, and K. Qin, “The 4-point α-ary approximating subdivision scheme,” Open Journal of Applied Sciences, vol. 3, no. 1, pp. 106–111, 2013.
View at: Publisher Site | Google Scholar
A. Ghaffar, Z. Ullah, M. Bari, K. S. Nisar, M. M. Al-Qurashi, and D. Baleanu, “A new class of -point binary non-stationary subdivision schemes,” Advances in Difference Equations, vol. 2019, 2019.
View at: Publisher Site | Google Scholar
A. Ghaffar, Z. Ullah, M. Bari, K. S. Nisar, and D. Baleanu, “Family of odd point non-stationary subdivision schemes and their applications,” Advances in Difference Equations, vol. 2019, no. 1, p. 20, 2019.
View at: Publisher Site | Google Scholar
A. Ghaffar, M. Bari, Z. Ullah, M. Iqbal, K. S. Nisar, and D. Baleanu, “A new class of 2q-point nonstationary subdivision schemes and their applications,” Mathematics, vol. 7, no. 7, p. 639, 2019.
View at: Publisher Site | Google Scholar
A. Ghaffar, M. Iqbal, M. Bari et al., “Construction and application of nine-tic B-spline tensor product SS,” Mathematics, vol. 7, no. 8, p. 675, 2019.
View at: Publisher Site | Google Scholar
P. Ashraf, B. Nawaz, D. Baleanu et al., “Analysis of geometric properties of ternary four-point rational interpolating subdivision scheme,” Mathematics, vol. 8, no. 3, p. 338, 2020.
View at: Publisher Site | Google Scholar
P. Ashraf, M. Sabir, A. Ghaffar, K. S. Nisar, and I. Khan, “Shape-preservation of ternary four-point interpolating non-stationary subdivision scheme,” Frontiers of Physics, vol. 7, 2020.
View at: Google Scholar
M. F. Hassan and N. A. Dodgson, “Ternary three-point univariate subdivision schemes,” in Curve and Surface Fitting: Saint-Malo (2002), pp. 199–208, Nashboro Press, Brentwood, 2003.
View at: Google Scholar
N. Dyn and D. Levin, “Subdivision schemes in geometric modelling,” Acta Numerica, vol. 11, pp. 73–144, 2002.
View at: Publisher Site | Google Scholar
N. Dyn, K. Hormann, M. A. Sabin, and Z. Shen, “Polynomial reproduction by symmetric subdivision schemes,” Journal of Approximation Theory, vol. 155, no. 1, pp. 28–42, 2008.
View at: Publisher Site | Google Scholar
C. Conti and K. Hormann, “Polynomial reproduction for univariate subdivision schemes of any arity,” Journal of Approximation Theory, vol. 163, no. 4, pp. 413–437, 2011.
View at: Publisher Site | Google Scholar
I. P. Ivrissimtzis, M. A. Sabin, and N. A. Dodgson, “On the support of recursive subdivision,” ACM Transactions on Graphics, vol. 23, no. 4, pp. 1043–1060, 2004.
View at: Publisher Site | Google Scholar
O. Rioul, “Simple regularity criteria for subdivision schemes,” SIAM Journal on Mathematical Analysis, vol. 23, no. 6, pp. 1544–1576, 1992.
View at: Publisher Site | Google Scholar
G. Mustafa, P. Ashraf, and N. Saba, “A new class of binary approximating subdivision schemes,” Jurnal Teknologi (Sciences and Engineering), vol. 78, no. 4, pp. 65–72, 2016.
View at: Google Scholar

Copyright

Copyright © 2020 Pakeeza Ashraf 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.

PDF Download Citation

Download other formats

Order printed copies

Views

559

Downloads

730

Citations