Abstract
In this paper, we propose and analyze a tensor product of nine-tic B-spline subdivision scheme (SS) to reduce the execution time needed to compute the subdivision process of quad meshes. We discuss some essential features of the proposed SS such as continuity, polynomial generation, joint spectral radius, holder regularity and limit stencil. Some results of the SS using surface modeling with the help of computer programming are shown.
MSC:
65D17; 65D07; 65D05
1. Introduction
Computer Aided Geometric Design (CAGD) considers the mathematical description of curves and surfaces utilized in computer graphics, data structure and computational algebra. CAGD has many fields of research interests. However, surface modeling is one of the important studies and an interesting area in the field of CAGD and computer graphics. Subdivision schemes (SSs) are iterative algorithms of surface modeling in CAGD. They are a type of models from discrete to discrete data having methods of generating curves/surfaces more effectively.
Nowadays, CAGD is the most common tool in the presentation of curves/surfaces. In CAGD, geometric shapes are related to the mathematical representations that satisfy approximation and interpolation properties of curves and surfaces. One of the common tools in CAGD are SSs, which provide an elegant way to describe curves and surfaces. Rham [1] was the first scholar who started work on SSs. He constructed a SS which generated a function with the first derivative. Chaikin [2] also used subdivision to design a curve. SSs gained importance when people generalized the tensor product in an arbitrary topology. This idea was presented by Doo and Sabin [3]. Catmull and Clark [4] used SSs to surface design and to control meshes in an arbitrary topology. Dyn et al. [5] generalized the SS of Dubuc and Deslauriers, known as butterfly SS, and concluded that the SS has smoothness in a certain range of shape parameter. In 1995, Dyn and Levin [6] introduced a technique for analyzing the Hermite-Type SSs for surface designs. In 1998, Stam [7] showed that surfaces and their derivatives can be described in terms of eigen basis functions. In 2002, Hassan et al. [8,9] worked on arity and number of control points. In 2005, Mustafa and Liu [10] worked on the SS of Bajaj with a new parameter that controlled the shape of models and gave them more flexibility to design a model over the soft and rough mesh network. Beccari et al. [11] produced an interpolating SS, which produced conic curve shapes. Mustafa et al. [12] unified the m-point approximating SS and showed that his SS has higher smoothness as compared to other SSs. Aslam et al. [13] introduced a formula that gives the mask of -point ternary interpolating as well as approximating SSs.
Zheng et al. [14] used B-spline to construct a -ary SS. In 2013, Mustafa et al. [15] worked on odd point ternary families of approximating SSs, in which they showed that their SSs have high smoothness. They also worked on subdivision regularization, in which they proposed that unified framework can work well for both over-fitting and noise removal in subdivision as well as regularization. In 2013, Ghaffar et al. [16] designed a three-point tensor product SS and showed some of its applications. Mustafa et al. [17] described a family of -point binary approximating SSs with tension parameters for generating curves. Again, Mustafa et al. [18] presented a general algorithm to generate a new class of binary approximating SSs and also have the derivation of some family members. In 2016, Hameed and Mustafa [19] constructed and analyzed binary SSs using Lane-Riesenfeld algorithm for curves and surfaces with Chaikin SS. In 2016, Ghaffar and Mustafa [20] proposed three different algorithms for approximating SS with application in curve modeling. In 2017, Cheng and Zhou [21] explained the necessary conditions of SSs with finite masks. During 2017, Akram et al. [22] discussed the properties of the binary four-point interpolating non-stationary SS [11]. In 2018, Manan et al. [23] focused on an algorithm to solve the third-order boundary value problem using eight-point approximating SS. In 2019, Kanwal et al. [24] formulated a numerical approximating collocation algorithm that is based on binary six-point approximating SS to generate the curves. Ghaffar et al. [25] introduced odd and even point non-stationary binary SSs for curve designing.
A simple smoothing tool for polygonal meshes is introduced which provide the motivation of our proposed work. The refine versions of the models are achieved by applying smoothing operation. The significance of the research problem to the success of such a model is that the transitions between the different resolutions of the meshes are almost imperceptible. This paper aims to construct a tensor product of nine-tic B-spline subdivision scheme to reduce the execution time needed to compute the subdivision process of quad meshes. The scheme, when computing the tetrahedron (four faces), as the number of faces increases, shows that the suggested technique performs better in model computation. The numerical results illustrate that the proposed SS reconstruct refined version of the models by using smoothing operation on regular meshes, but it doesn’t reproduced parametric curves/surfaces that have logarithmic functions and division terms i.e non-exponential polynomials, which actually needs non-uniform masks of SS for the exact reproduction of such models.
2. Properties of the SS
Here, firstly we introduce the nine-tic B-spline SS. We analyze the SS by examining the important features: continuity, hölder exponent, polynomial generation and reproduction, joint spectral radius, local analysis with invariant neighborhood and limiting curve produced by the nine-tic B-spline SS. It is defined as:
2.1. Smoothness of the SS
Theorem 1
([26]). The SS is convergent if and only if the SS is contractive, then for contractiveness for some with , where are the coefficients of the SS with symbol .
Theorem 2.
If converges, then the limit curves can be denoted by . is the SS for the qth divided differences.
Proof.
To prove continuity of the SS related to , we have to show the convergence of . To see this we generate another SS related to collected from as:
where
The SS is contractive. For this, we have,
Thus, SS is contractive, is convergent and is continuous.
For continuity of the SS, we can rewrite as:
where
To prove continuity of the SS related to , we have to show the convergence of . To see this, we generate another SS related to collected from as:
For the contractivity of the SS , we have
Thus, SS is contractive, is convergent and is continuous.
For continuity of the SS, we can rewrite as
where
To prove continuity of the SS related to , we have to show the convergence of . To see this, we generate another SS related to collected from as:
For the contractivity of the SS , we have
Hence, the SS is contractive. This implies the has smoothness. □
2.2. Holder Exponent
Here, we find holder continuity of the nine-tic B-spline.
Theorem 3.
Consider that the SS (Equation (1)) with symbol produces limit curves with Holder continuity for some m.
Proof.
Here, and , which implies that □
2.3. Polynomial Generation and Reproduction
In this section, we discuss the degree of polynomial generation and polynomial reproduction of nine-tic B-spline SS.
Theorem 4.
Proof.
Since the Laurent polynomial of the SS (Equation (1)) is
where
then 9 is the degree of polynomial generation.
which shows that degree of polynomial generation is 9. □
Theorem 5.
Proof.
For any SS that generates linear functions with symbol
let attach the data to parameter
then the SS also reproduces linear functions. The Laurent polynomial of the SS (Equation (1)) is:
After putting , we get
Thus, the nine-tic B-spline SS generates linear reproduction with respect to primal parameterization. This SS is primal parameterization. □
2.4. Local Analysis with Invariant Neighborhood
In this section, we calculate the limit stencil of Nine-tic B-Spline SS by using local analysis. Using limit stencil, we locate the confine position of control point of initial control polygon on the point of confinement curve. For this, by considering the SS (Equation (1)), we can write it in matrix form as:
The local subdivision matrix of the presented SS is:
The proposed SS has invariant neighborhood size 9 and the corresponding eigenvalues of the subdivision matrix are . For eigenvectors related to eigenvalues, we obtain:
Thus,
and
and the eigen decomposition of is
where
Using diagonalization process of a matrix , whereas ∧ = diagonal matrix, indicates that , where , and shows that Since ∧ is a diagonal matrix, for some diagonal matrix, means square of entries diagonally and so on. Thus,
In addition, then . Thus, using eigen decomposition of , we have, and so on. shows that Now, by applying limit , implies that .
Hence, the limit stencils are:
3. Construction and Analysis of Nine-tic B-Spline Tensor Product SS
3.1. Preliminaries
In this section, we construct nine-tic B-Spline tensor product SS. We analyze the SS by reviewing the continuity of the SS and limiting behavior of the curve generated by nine-tic B-spline tensor product SS. The Laurent polynomial of tensor product SS can be acquired by the accompanying principle:
where and are the Laurent polynomials of univariate SSs.
A general compact form of binary SS which maps a polygon to a refined polygon is defined by
where for curve and for surface. In the case of univariate SSs, the two rules ( for u is even and odd) are given below as:
Let , then
To get second rule, we assume , then
In the case of tensor product (bivariate) SS, we have four rules subject to the uniformity of each component in the multi-index .
A necessary condition for uniform convergence of SS (Equation (5)) is given in the following theorem.
Theorem 6
([26]). Let be the symbol or Laurent polynomial of bivariate SS , which is defined on quad-meshes. Then, a necessary condition for the convergence of is:
This implies that:
Theorem 7
([26]). Suppose the SSs with symbols and , are both contractive, namely
for any initial data then the SS with the symbol: is convergent. Conversely, if is convergent, then and are contractive.
Remark 1
([26]). Thus, convergence is checked in this case by checking the contractivity of two SSs If , which is typical for SSs having the symmetry of the square grid, then , and the contractivity of only one SS has to be checked.
Theorem 8
([26]). Let
If the SSs with the masks
are convergent, then generate function.
Remark 2
([26]). For continuity of , we have to show that the SSs , corresponding to masks for are convergent and it is equivalent to checking whether SSs and corresponding to the masks and are contractive, which is equivalent to checking whether and , for some integer . Since there are four rules for computing the values at next refinement level, we define the norm as:
where
3.2. Construction of Nine-tic B-Spline Tensor Product SS
Consider the proposed nine-tic B-spline SS (Equation (1)), and its mask is:
and its Laurent polynomial is given as:
This implies that
Since , then we have the following Laurent polynomial of nine-tic B-spline SS :-
From Equation (1), we suggest the following nine-tic B-spline tensor product SS:
3.3. Analysis of Nine-tic B-Spline Tensor Product SS
In this section, we present continuous nine-tic B-Spline tensor product SS. To check the continuity of the nine-tic B-Spline tensor product SS (Equation (11)), we apply similar analysis tools to those in the case. From Equation (8) for and then from Equation (9), we get
This implies
If and are SSs corresponding to the masks and , respectively, then
and
This implies
and
Let be the SS corresponding to the Laurent polynomial, then, by using Equation (10), from Equations (13) and (14), we have that are contractive, thus by Theorem 7, the SSs , corresponding to masks for are convergent. Hence, by Theorem 8, the proposed SS is continuous.
By applying the above procedure repeatedly, we found that the proposed SS has continuity (the proof is given in Appendix A).
4. Numerical Examples
In this section, performance of our nine-tic B spline tensor product SS is discussed. The refinement algorithm of nine-tic B spline tensor product SS creates a new vertex position corresponding to both vertex and face of the original mesh. It is observed that the new vertices are weighted averages of the vertex points belonging to each pair (face, vertex) of the original mesh. For the nine-tic B spline tensor product case, these weights (going around a face) are:
The newly created vertices are then connected to form the faces of the refined control mesh.
The refined model is generated from the control polygon in the following way. Each vertex point is obtained in the proportion of [10: 120: 252: 120: 10:]/512 and each edge point is obtained in the proportion of [1: 45: 210: 210: 45: 1:]/512. A face point is achieved as the centroid of every mesh of the given control polygon, and vertex point is achieved as the normal of a vertex mesh in the control polygon. The new points are then associated with each other. There are two edges along each side of each vertex of the previous mesh. These pairs are related and form quadrilaterals over the old edges. Inside every control polygon, there are the same number of new vertices. These are related to each other inside the control polygon. Lastly, around every old vertex there is another vertex in the adjoining corner of each old polygon. These are associated to form another polygon with the same number of edges. The new mesh generates quadrilaterals for each edge in the old vertex, and makes a little n-sided polygon. Each n-sided polygon produces a n-sided polygon for each n-valence (valence being the number of edges that touch the vertex). After the first iteration of our SS, all vertices have a valence of four, thus resulting applications generate quadrilaterals for the vertices. To make a smooth model, the SS is applied repeatedly. In Figure 1, Figure 2 and Figure 3, show the visual performance of our proposed SS. We used MATLAB software for the implementation of our proposed SS as a plug in inanimation and modeling industry and achieved required refine model after applying the 5th level of the proposed SS.
Figure 1.
(a) The initial polygon; and (b–f) the results up to fifth subdivision levels.
Figure 2.
(a) The initial polygon; and (b–f) the results up to fifth subdivision levels.
Figure 3.
(a) The initial polygon; and (b–f) the results up to fifth subdivision levels.
Comparison of NURBS & Proposed SS
This section defines the comparison of the proposed scheme with NURBS. The NURBS is either a torus, disk or a tube and many NURBS patches are applied to form a surface models as shown in Figure 4. After the deformation of the NURBS surfaces, the cracks appears at the joints. In Figure 1, Figure 2 and Figure 3 shows that continues surfaces are generated as the limit of a sequence of successive refinements. All theother properties such as efficiency, compact support, local definition, affine invariance, simplicity and smoothness are the same properties as the NURBS have, but it will work for any topology. Subdivision is a data structure used to store mesh data in a convenient way so that the mesh information can be easily accessed. It is clearly seen that proposed SS shows smoothness in generating different curves.

Figure 4.
(a) The results of the NURBS; and (b–f) the deformation of a surface made of NURBS patches.
5. Conclusions and Future Work
This paper contributes the nine-tic B-spline approximating bivariate SS to reduce the execution time needed to compute the subdivision process of quad meshes. We have discussed some interesting features such as polynomial generation, smoothness, joint spectral radius, holder continuity, limit stencils of the proposed SS. We used Laurent polynomial (symbol) method to find the smoothness of our proposed SS and it is observed that our proposed SS gives good results for modeling of curves and surfaces as shown in figures. There are many directions of future work. Firstly, spreading of tensor product SS to a mesh with arbitrary topology. We are also interested to work on reproducing exact surface models by SS. If we could generate exact surface models having singular points, we will be able to solve some additional issues regarding SS.
Author Contributions
Conceptualization, A.G., M.B. and M.I.; methodology, K.S.N. and D.B.; software, A.G., S.M.H. and R.M.; validation, A.G. and K.S.N.; formal analysis, S.M.H., D.B. and R.M.; writing—original draft preparation, A.G., M.I., M.B., S.M.H. and R.M.; writing—review and editing, K.S.N. and D.B.
Funding
This research received no external funding.
Conflicts of Interest
The authors declare no conflict of interest.
Appendix A
If and are a SSs corresponding to the mask and for , then
This implies
References
- De Rham, G. Un peu de mathématiques à propos d’une courbe plane. Elem. Der Math. 1947, 2, 73–76. [Google Scholar]
- Chaikin, G.M. An algorithm for high-speed curve generation. Comput. Graph. Image Process. 1974, 3, 346–349. [Google Scholar] [CrossRef]
- Doo, D.; Sabin, M. Behaviour of recursive division surfaces near extraordinary points. Comput. Aided Des. 1978, 10, 356–360. [Google Scholar] [CrossRef]
- Catmull, E.; Clark, J. Recursively generated B-spline surfaces on arbitrary topological meshes. Comput. Aided Des. 1978, 10, 350–355. [Google Scholar] [CrossRef]
- Dyn, N.; Levine, D.; Gregory, J.A. A butterfly subdivision scheme for surface interpolation with tension control. ACM Trans. Graph. 1990, 9, 160–169. [Google Scholar] [CrossRef]
- Dyn, N.; Levin, D. Analysis of Hermite-type subdivision schemes. Ser. Approx. Decompos. 1995, 6, 117–124. [Google Scholar]
- Stam, J. Exact evaluation of Catmull-Clark subdivision surfaces at arbitrary parameter values. In Proceedings of the 25th Annual Conference on Computer Graphics and Interactive Techniques, Orlando, FL, USA, 19–24 July 1998; pp. 395–404. [Google Scholar]
- Hassan, M.; Dodgson, N.A. Ternary and Three-Point Univariate Subdivision Schemes; No. UCAM-CL-TR-520; University of Cambridge, Computer Laboratory: Cambridge, UK, 2001; pp. 1–15. [Google Scholar]
- Hassan, M.F.; Ivrissimitzis, I.P.; Dodgson, N.A.; Sabin, M.A. An interpolating 4-point C2 ternary stationary subdivision scheme. Comput. Aided Geom. Des. 2002, 19, 1–18. [Google Scholar] [CrossRef]
- Mustafa, G.; Liu, X. A subdivision scheme for volumetric models. Appl. Math. J. Chin. Univ. 2005, 20, 213–224. [Google Scholar] [CrossRef]
- Beccari, C.; Casciola, G.; Romani, L. An interpolating 4-point C2 ternary non-stationary subdivision scheme with tension control. Comput. Aided Geom. Des. 2007, 24, 210–219. [Google Scholar] [CrossRef]
- Mustafa, G.; Khan, F.; Ghaffar, A. The m-point approximating subdivision scheme. Lobachevskii J. Math. 2009, 30, 138–145. [Google Scholar] [CrossRef]
- Aslam, M.; Mustafa, G.; Ghaffar, A. The (2n-1)-Point Ternary Approximating and Interpolating subdivision schemes. J. Appl. Math. 2011, 2011. [Google Scholar] [CrossRef]
- Zheng, H.; Hu, M.; Peng, G. Ternary even symmetric 2n-point subdivision. In Proceedings of the Computational Intelligence and Software Engineering, CiSE, Wuhan, China, 11–13 December 2009; pp. 1–4. [Google Scholar]
- Mustafa, G.; Ghaffar, A.; Aslam, M. A subdivision-regularization framework for preventing over fitting of data by a model. Appl. Appl. Math. Int. J. 2013, 8, 178–190. [Google Scholar]
- Ghaffar, A.; Mustafa, G.; Qin, K. Construction and application of 3-point tensor product subdivision scheme. Appl. Math. 2013, 4, 477–485. [Google Scholar] [CrossRef][Green Version]
- Mustafa, G.; Ghaffar, A.; Bari, M. The (2n-1)-point binary approximating subdivision scheme. In Proceedings of the Eighth International Conference on Digital Information Management (ICDIM 2013), Islamabad, Pakistan, 10–12 September 2013; pp. 363–368. [Google Scholar]
- Mustafa, G.; Ashraf, P.; Saba, N. A new class of binary approximating subdivision schemes. J. Teknol. 2016, 78, 65–72. [Google Scholar] [CrossRef]
- Hameed, R.; Mustafa, G. Construction and analysis of binary subdivision schemes for curves and surfaces originated from Chaikin points. Int. J. Anal. 2016, 2016. [Google Scholar] [CrossRef]
- Ghaffar, A.; Mustafa, G. An Alternative Method for Constructing Subdivision Algorithm. Sci. Int. 2016, 28, 5011–5015. [Google Scholar]
- Cheng, L.; Zhou, X. Necessary conditions for the convergence of subdivision schemes with finite masks. Appl. Math. Comput. 2017, 303, 34–41. [Google Scholar] [CrossRef]
- Akram, G.; Bibi, K.; Rehan, K.; Siddiqi, S.S. Shape preservation of 4-point interpolating non-stationary subdivision scheme. J. Comput. Appl. Math. 2017, 319, 480–492. [Google Scholar] [CrossRef]
- Manan, S.A.; Ghaffar, A.; Rizwan, M.; Rahman, G.; Kanwal, G. A subdivision approach to the approximate solution of 3rd order boundary value problem. Commun. Math. Appl. 2018, 9, 499–512. [Google Scholar]
- Kanwal, G.; Ghaffar, A.; Hafeezullah, M.M.; Manan, S.A.; Rizwan, M.; Rahman, G. Numerical solution of 2-point boundary value problem by subdivision scheme. Commun. Math. Appl. 2019, 10, 1–11. [Google Scholar]
- Ghaffar, A.; Ullah, Z.; Bari, M.; Nisar, K.S.; Baleanu, D. Family of odd point non-stationary subdivision schemes and their applications. Adv. Differ. Equ. 2019, 2019, 171. [Google Scholar] [CrossRef]
- Dyn, N. Analysis of convergence and smoothness by the formalism of Laurent polynomials. In Tutorials on Multiresolution in Geometric Modelling; Springer: Berlin/Heidelberg, Germany, 2002; pp. 51–68. [Google Scholar]
© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).