Abstract
Subdivision schemes (SSs) have been the heart of computer-aided geometric design almost from its origin, and several unifications of SSs have been established. SSs are commonly used in computer graphics, and several ways were discovered to connect smooth curves/surfaces generated by SSs to applied geometry. To construct the link between nonstationary SSs and applied geometry, in this paper, we unify the interpolating nonstationary subdivision scheme (INSS) with a tension control parameter, which is considered as a generalization of 4-point binary nonstationary SSs. The proposed scheme produces a limit surface having \(C^{1}\) smoothness. It generates circular images, spirals, or parts of conics, which are important requirements for practical applications in computer graphics and geometric modeling. We also establish the rules for arbitrary topology for extraordinary vertices (valence ≥3). The well-known subdivision Kobbelt scheme (Kobbelt in Comput. Graph. Forum 15(3):409–420, 1996) is a particular case. We can visualize the performance of the unified scheme by taking different values of the tension parameter. It provides an exact reproduction of parametric surfaces and is used in the processing of free-form surfaces in engineering.
Similar content being viewed by others
1 Introduction
The subdivision is a very popular geometric modeling tool. Subdivision algorithms are widely used in computer graphics and computer aided geometric design (CAGD) due to their efficiency, flexibility, and simplicity. There are two common classes of SSs. One is approximating in which the limit surface usually does not go through its control vertices, and in case of interpolating, the limit surface interpolates all subdivision steps of control vertices exactly, which is most appropriate to engineering applications. They seem to have their origin in the geometric problem of smoothing the corners of a given polygon. Further, SSs are classified into stationary and nonstationary schemes. The proposed scheme is in the class of nonstationary interpolating schemes. The idea of nonstationary SSs was given by Dyn and Levin [2]. Nonstationary SSs form a standard structure for introducing self-referential sets such as practical applications in computer graphics and provide a potential new technique of researching the texture and shape of images. Yonggang et al. [3] proved that the trigonometric polynomial B-spline curves not only inherit the useful advantage of the polynomial curve but also have reconstructing property of the trigonometric curve. Due to its importance in generating images, several unifications to the nonstationary schemes such as interpolating and approximating are discussed in the literature [4–17]. Being two various subjects that had been improving individually and in parallel, the relation between curves and surfaces of SSs have sought after. Later, it was proved that there is a close relation between curves and surfaces produced by SSs. Kobbelt [1] has extended the technique of [18] and constructed interpolating SS on open quadrilateral meshes with arbitrary topology. Reif [19] has established a generalized technique to the SSs near extraordinary vertices. Fang et al. [20] introduced the unified stationary SS of arbitrary order with image controlling variable, but it does not hold up the surfaces like sphere and hyperboloid. Recently, Ghaffar et al. [21] have introduced tensor products of nine-tic B-spline. Therefore, the natural way to define refinement operators for quadrilateral nets to modify a tensor product scheme such that special rules for the vicinity of nonregular vertices are found. The proposed unified INSS has such potential. The main contribution is as follows:
-
Three different schemes (trigonometric, polynomial, and hyperbolic) of surface work under one parameter.
-
The proposed schemes reproduce trigonometric functions and hyperbolic functions.
-
Results from the hyperbolic scheme are shown in Fig. 7.
The decomposition is extended to regular vertices of quadrilateral surfaces by the tensor product of a unified scheme. Rules for extraordinary and boundary vertices are also established based on repeated local operations. The performance of INSS, which based on quadrilaterals, is comparatively better to triangles for constructing the symmetries of natural and human objects such as legs, arms, and fingers. The major advantage of the proposed scheme is that it has the interpolation property and works on quadrilateral nets, which are most appropriate for engineering applications. Here we present the rule of the unified scheme for arbitrary topology (valence ≥ 3). To achieve this, it may be necessary to use one step of the Catmull Clark method to eliminate extraordinary faces. In quad meshes, there remains only the question of how to compute new edge points and new face points. No new vertex points are computed since the method is interpolating. The nonstationary tension parameter of our scheme is used to control the image of resulting surfaces and the interpolation of the control mesh to limit surface.
Section 2 shows the rules of unified INSS. By topological regularity we mean a tensor product structure with four faces meeting at every vertex. Section 2 is also based on a unified surface subdivision for arbitrary topology. Boundary and crease features are also discussed. Section 3 gives the reconstruction of sine and cosine functions. Also, the analysis of the proposed scheme is presented in this section. Section 4 provides the numerical examples for open (boundary edges occur, which belong to one face) and closed nets (every edge is part of exactly two faces). Section 5 holds the conclusion.
2 Unified four-point binary interpolating nonstationary SS
This section is intended to use a framework for the construction of a unified family of four-point SS for curve and surface designing. The framework has two cases. In the first case, we construct a univariate scheme. In the second case, we derive the bivariate scheme (regular or irregular surfaces).
2.1 Curve case
Here we introduce the algorithmic technique for the construction of the univariate family of unified four-point binary INSS by applying trigonometric, polynomial, and hyperbolic basis. We can describe the proposed scheme as various stage construction.
-
Consider interpolating the limiting curve from the linear space spanned by \(\{1, y, \sin (y), \cos (y)\}\), \(\{1, y, y^{2}, y^{3}\}\), and \(\{1, y, \sinh (y), \cosh (y)\}\).
-
Describe the control polygon \(\{q_{m}^{\ell }|i\in \mathbb{Z}\}\) at refinement subdivision step ℓ and the interpolation of initial data \(q_{i+h}^{\ell }\), \(h=-1,0,1,2\), by a limit curve of the forms \(q(y)=\alpha _{0}+\alpha _{1}y+\alpha _{2}\cos (y)+\alpha _{3}\sin (y)\), \(q(y)=\alpha _{0}+\alpha _{1}y+\alpha _{2}y^{2}+\alpha _{3}y^{3}\), and \(q(y)=\alpha _{0}+\alpha _{1}y+\alpha _{2}\cosh (y)+\alpha _{3}\sinh (y)\).
-
Obtain a system of linear equations by the interpolation of initial data \(q^{\ell }_{i+h}\) corresponding to \(y=h\theta /2^{\ell }\), \(0\leq \theta \leq \frac{\pi }{2}\).
-
Now find a solution of the system of equations \(f(-2^{-\ell }\theta )=q_{m-1}^{\ell }\), \(q(0)=q_{m}^{\ell }\), \(q(2^{-\ell }\theta )=q_{m+1}^{\ell }\) and \(q(2^{-\ell +1}\theta )=q_{m+2}^{\ell }\) for unknowns constants \(\alpha _{0}\), \(\alpha _{1}\), \(\alpha _{2}\) and \(\alpha _{3}\). We obtained three different schemes (trigonometric, polynomial, and hyperbolic) depending on the spanning set.
-
Unifying these SSs, we obtained the following INSS with control polygon \(q_{m}^{0}=q_{m}\), \(-2\leq m\leq N+2\):
$$\begin{aligned}& q^{\ell +1}_{2m}=q^{\ell }_{m},\quad -1\leq m\leq 2^{\ell }N+1, \\& q^{\ell +1}_{2m+1}=\alpha ^{\ell } \bigl(q^{\ell }_{m-1}+q^{\ell }_{m+2} \bigr)+\beta ^{\ell } \bigl(q^{\ell }_{m}+q^{\ell }_{m+1} \bigr), \quad -1\leq m\leq 2^{\ell }N, \end{aligned}$$(1)where
$$ \alpha ^{\ell }=-\frac{1}{8\mu _{\ell +1}(\mu _{\ell +1}+1)}\quad \mbox{and}\quad \beta ^{\ell }= \frac{(2\mu _{\ell +1}+1)^{2}}{8\mu _{\ell +1}(\mu _{\ell +1}+1)}, $$where ℓ shows the subdivision step or refinement level of INSS, and \(\mu _{\ell +1}=\cos(\theta /2^{\ell +1})\), 1, and \(\cosh(\theta /2^{\ell +1})\) for trigonometric, polynomial, and hyperbolic cases, respectively.
2.2 Regular surface case
Let \(\{q_{m,n}^{0}; m=-2,\ldots,N+2, n=-2,\ldots,N+2\}\) be the sequence of control polygon at the initial subdivision step. For the ℓth subdivision step, the newly generated control points are calculated by using tensor product of univariate INSS (1):
This extended scheme is designed to calculate the algorithm for quadrilateral surfaces. In the considered regular case the valence of vertex is 4, that is, 4 rule for the insertion of points. For insertion of edge points, we use the rules \(q^{\ell +1}_{2m+1,2n}\) and \(q^{\ell +1}_{2m,2n+1}\) in horizontal and vertical directions, respectively; see Fig. 1(a) as \(\alpha ^{\ell }=\alpha ^{\mathrm{l}}\). The rules \(q^{\ell +1}_{2m+1,2n+1}\) and \(q^{\ell +1}_{2m,2n}\) are used to insert new face points as shown in Fig. 1(b) as \(\beta ^{\ell }=\beta ^{\mathrm{l}}\).
2.3 Irregular surface case
Irregular surfaces are those that cannot be unfolded or unrolled to lie in a flat plane. Solids that have irregular or warped surfaces cannot be created merely by extrusion or revolution. These irregular surfaces are created using surface modeling techniques. In irregular cases, that is, meshes include vertices where other than four faces meet except at boundary, we adopted the subdivision criteria followed by Kobbelt’s SS for arbitrary topology. So the unified INSS requires only one more rule to insert edge points on a nonregular vertex corresponding to the adjacent vertex. All remaining edge and face points are generated by using the unified four point INSS. By applying the proposed scheme it is possible that the points \(X_{m}\) and \(Y_{m}\) are undefined. If we need both possible ways to compute \(X_{m}\) and \(Y_{m}\) by using the proposed scheme to the succeeding edge points, which lead to the same result, then we find a dependence relation for \(X_{m+1}\) to \(X_{m}\), with one edge to the next edge, and we have the notion \(K_{m-2}\), \(K_{m-1}\), \(K_{m}\), \(K_{m+1}\), \(K_{m+2}\) with arbitrary point P; see Fig. 1(c). Now we have
which implies
where \(\zeta ^{\ell }=1/8\mu _{\ell +1}(1+\mu _{\ell +1})(1+2\mu _{\ell +1})^{2}\).
The undefined point \(X_{m}\) will be computed by rotation of mask of the SS. Thus the neighborhood points of P will become symmetric with the refinement process. By using a similar approach of [1] we can define the following equation:
where for \(n\geq 4\),
with \({\vartriangle } X_{m+n}=X_{i+j+1}-X_{m+n}\) denoting the difference, and the face treated as vertex \(V_{n}\) of unified INSS is defined as
and
Unifying of the common terms of the scheme and putting (2) into (3), we get
By taking \(a=3\) we get \(L_{m-1}=L_{m+2}=K_{m-2}=K_{m+2}\). Thus by using our unified four point rule to the neighboring points P, \(H_{n}\), \(L_{n}\), and \(V_{n}\), \(n=0,\ldots,a-1\), the edge points \(X_{n}\) can be computed easily. Similarly, we compute the face points \(Y_{n}\), and it does not matter whether we compute \(X_{m}\) (horizontally) or \(X_{m+1}\) (vertically). In other words, we can compute all vertex points for the face containing an isolated extraordinary vertex from a regular mesh with virtual point \(V_{n}\).
2.4 Open polygons and boundary curves
It is impossible to insert the first and last edge points of an open polygon by the unified scheme (1). It needs two neighborhood points to compute the edge point \(q_{1}^{\ell +1}\), which refines the first edge point by \(q_{0}^{\ell }q_{1}^{\ell }\). By describing the extrapolated edge point \(q_{-1}^{\ell }=2q_{0}^{\ell }-q_{1}^{\ell }\) the initial point \(q_{1}^{\ell +1}\) is computed by using (1) on the subpolygon formed by \(q_{-1}^{\ell }\), \(q_{0}^{\ell }\), \(q_{1}^{\ell }\), \(q_{2}^{\ell }\). The additional rule can be denoted as a linear combination of nonextrapolated initial points \(q_{0}^{\ell }\), \(q_{1}^{\ell }\), \(q_{2}^{\ell }\):
The rule to insert the point \(q_{2n-1}^{\ell +1}\) refining the last edge point \(q_{n-1}^{\ell }q_{n}^{\ell }\) is defined as
If the point on the boundary edge has a corner vertex (valence 2), then we use the boundary rule to insert the edge points on it. Applying the boundary rules \(q_{-1}^{\ell }=2q_{0}^{\ell }-q_{1}^{\ell }\), \(q_{n+1}^{\ell }=2q_{n}^{\ell }-q_{n-1}^{\ell }\), and \(q_{n+2}^{\ell }=2q_{n}^{\ell }-q_{n-2}^{\ell }\), we can produce limit curves/surfaces of open polygon at the end vertices or boundary vertices (valence > 2).
Lemma 2.1
The unified IRSS satisfies the affine invariance property.
Proof 2.1
Since \(\alpha ^{\ell }+\beta ^{\ell }+\beta ^{\ell }+\alpha ^{\ell }=1\), the unified IRSS satisfies the affine invariance property.
Remark 2.1
The unified IRSS is primal because of odd symmetry.
Remark 2.2
The unified scheme is exactly the well-known four-point scheme of [4] and [18] for \(\mu _{\ell +1}=1\). The polynomial case of unified scheme (1) comes from cubic interpolatory polynomial, so the polynomial reproduction will be cubic.
2.5 Analysis of unified scheme
For \(\mu _{\ell +1}=\cos (\frac{\theta }{2^{\ell +1}} ), 1\), and \(\cosh (\frac{\theta }{2^{\ell +1}} )\), the masks of the unified schemes coincides with the mask of Kobbelt’s scheme [1] as \(\ell \rightarrow \infty \). For \(\mu _{\ell +1}=\cos (\frac{\theta }{2^{\ell +1}} )\), we have
Similarly, for other values of \(\mu _{\ell +1}\), we get the same mask. In [11], it is proved that the scheme of Kobbelt [1] at all control points of closed meshes is \(C^{1}\)-continuous. Since in the limiting case the Kobbelt scheme is a particular case of the unified scheme, the latter is also \(C^{1}\)-continuous in this case.
Tables 1–5 indicate the eigenvalues of the proposed SS at \(\mu _{\ell +1}=\cos (\frac{\theta }{2^{\ell +1}} ), 1\), and \(\cosh (\frac{\theta }{2^{\ell +1}} )\) for \(\theta =\pi /3\) and \(\theta =2\pi /5\). From these tables we observe that the largest eigenvalue is one, and the other eigenvalues are less than one, and thus the unified scheme is convergent. Since the second and third eigenvalues are same, the unified scheme is \(C^{1}\)-continuous by [19].
3 Reproduction of functions
Consider the functions \(\sin (\cdot )\), \(\cos (\cdot )\), \(\sin (\cdot )\sin (\cdot )\), \(\cos (\cdot )\cos (\cdot )\), \(\cos (\cdot )\sin (\cdot )\), \(\cosh (\cdot )\), \(\cosh (\cdot )\cosh (\cdot )\), \(\sinh (\cdot )\), \(\sinh (\cdot )\sinh (\cdot )\), and \(\cosh (\cdot )\sinh (\cdot )\) can be reproduced by unified SSs.
Lemma 3.1
Let \(q^{\ell }_{m}=\cos (\frac{m\theta }{2^{\ell }} )\) (or \(q^{\ell }_{m}=\sin (\frac{m\theta }{2^{\ell }} ) \)) for \(-1\leq m\leq 2^{\ell }N+1\), \(l\geq 0\). Then \(q^{\ell +1}_{2m}=\cos (\frac{2m\theta }{2^{\ell +1}} )\) (or \(q^{\ell +1}_{2m}=\sin (\frac{2m\theta }{2^{\ell +1}} ) \)).
Proof 3.1
Since \(q^{\ell }_{m}=\cos (\frac{m\theta }{2^{\ell }} )\), it is obvious that \(q^{\ell +1}_{2m}=\cos (\frac{2m\theta }{2^{\ell +1}} )\). Similarly, for \(q^{\ell }_{m}=\sin (\frac{m\theta }{2^{\ell }} )\), we have \(q^{\ell +1}_{2m}=\sin (\frac{2m\theta }{2^{\ell +1}} )\).
Lemma 3.2
Let \(q^{\ell }_{n}=\cos (\frac{n\theta }{2^{\ell }} )\) for \(-1\leq n\leq 2^{\ell }N+1\), \(l\geq 0\). Then \(q^{\ell +1}_{2n+1}=\cos (\frac{(2n+1)\theta }{2^{\ell +1}} )\).
Proof 3.2
From (1) with \(m=n\) we have
Putting \(\mu _{\ell +1}=\cos (\frac{\theta }{2^{\ell +1}} )\), \(q^{\ell }_{n-1}=\cos (\frac{(n-1)\theta }{2^{\ell }} )\), \(q^{\ell }_{n}=\cos (\frac{n\theta }{2^{\ell }} )\), \(q^{\ell }_{n+1}=\cos (\frac{(n+1)\theta }{2^{\ell }} )\), and \(q^{\ell }_{n+2}=\cos (\frac{(n+2)\theta }{2^{\ell }} )\), we have
Applying the identities \(1+\cos (\alpha )=2\cos ^{2} (\frac{\alpha }{2} )\) and \(\cos (\alpha )+\cos (\beta )=2\cos (\frac{\alpha +\beta }{2} )\cos (\frac{\alpha -\beta }{2} )\), we get
and
Then
Since
applying the identity \(\sin ^{2} (\frac{\alpha }{2} )=\frac{1-\cos \alpha }{2}\), we have
By the identity \(\cos a-\cos b=-2\sin (\frac{a+b}{2} )\sin ( \frac{a-b}{2} )\) we have
Similarly, putting \(\mu _{\ell +1}=\cos (\frac{\theta }{2^{\ell +1}} )\), and applying the identities \(1+\cos (\alpha )=2\cos ^{2} (\frac{\alpha }{2} )\), \(\sin (\alpha )+\sin (\beta )=2\sin (\frac{\alpha +\beta }{2} )\cos (\frac{\alpha -\beta }{2} )\), \((3\sin (\frac{\theta }{2^{\ell +2}} )-4\sin ^{3} (\frac{\theta }{2^{\ell +2}} ) )^{2}=\sin ^{2} ( \frac{3\theta }{2^{\ell +2}} )\), \(\sin ^{2} (\frac{3\alpha }{2} )=\frac{1-\cos 3\alpha }{2}\), \(\sin ^{2} (\frac{\alpha }{2} )=\frac{1-\cos \alpha }{2}\), and \(\cos \alpha -\cos \beta =-2\sin (\frac{\alpha +\beta }{2} )\sin (\frac{\alpha -\beta }{2} )\), we have the following lemma.
Lemma 3.3
Let \(q^{\ell }_{n}=\sin (\frac{n\theta }{2^{\ell }} )\) for \(-1\leq n\leq 2^{\ell }N+1\), \(l\geq 0\). Then \(q^{\ell +1}_{2n+1}=\sin (\frac{(2n+1)\theta }{2^{\ell +1}} )\).
By Lemmas 3.1–3.3, applying \(q^{\ell }_{m, n}=q^{\ell }_{m}q^{\ell }_{n}\), we have the following theorems.
Theorem 3.3
Let \(q^{\ell }_{m}=\cos (\frac{m\theta }{2^{\ell }} )\) and \(q^{\ell }_{n}=\cos (\frac{n\theta }{2^{\ell }} )\) for \(-1\leq m\), \(n\leq 2^{\ell }N+1\), \(l\geq 0\). Then
Theorem 3.4
Let \(q^{\ell }_{m}=\cos (\frac{m\theta }{2^{\ell }} )\) and \(q^{\ell }_{n}=\sin (\frac{n\theta }{2^{\ell }} )\) for \(-1\leq m\), \(n\leq 2^{\ell }N+1\), \(l\geq 0\). Then
Theorem 3.5
Let \(q^{\ell }_{m}=\sin (\frac{m\theta }{2^{\ell }} )\) and \(q^{\ell }_{n}=\sin (\frac{n\theta }{2^{\ell }} )\) for \(-1\leq m\), \(n\leq 2^{\ell }N+1\), \(l\geq 0\). Then
Lemma 3.4
Let \(q^{\ell }_{m}=\cosh (\frac{m\theta }{2^{\ell }} )\) (or \(q^{\ell }_{m}=\sinh (\frac{m\theta }{2^{\ell }} ) \)) for \(-1\leq m\leq 2^{\ell }N+1\), \(l\geq 0\). Then \(q^{\ell +1}_{2m}=\cosh (\frac{2m\theta }{2^{\ell +1}} )\) (or \(q^{\ell +1}_{2m}=\sinh ( \frac{2m\theta }{2^{\ell +1}} ) \)).
Proof 3.6
Since \(q^{\ell }_{m}=\cosh (\frac{m\theta }{2^{\ell }} )\), it is obvious that \(q^{\ell +1}_{2m}=\cosh (\frac{2m\theta }{2^{\ell +1}} )\). Similarly, we get \(q^{\ell +1}_{2m}=\sinh (\frac{2m\theta }{2^{\ell +1}} )\).
Lemma 3.5
Let \(q^{\ell }_{n}=\cosh (\frac{n\theta }{2^{\ell }} )\) for \(-1\leq n\leq 2^{\ell }N+1\), \(l\geq 0\). Then \(q^{\ell +1}_{2n+1}=\cosh (\frac{(2n+1)\theta }{2^{\ell +1}} )\).
Proof 3.7
From (1) with \(i=j\) we have
Substituting \(\mu _{\ell +1}=\cosh (\frac{\theta }{2^{\ell +1}} )\), \(q^{\ell }_{n-1}=\cosh (\frac{(n-1)\theta }{2^{\ell }} )\), \(q^{\ell }_{n}=\cosh (\frac{n\theta }{2^{\ell }} )\), \(q^{\ell }_{n+1}=\cosh (\frac{(n+1)\theta }{2^{\ell }} )\), and \(q^{\ell }_{n+2}=\cosh (\frac{(n+2)\theta }{2^{\ell }} )\), we get
Let \(\iota = \mbox{iota}\). Then applying \(\sinh (\alpha )=-\iota \sin (\iota \alpha )\), \(\cosh (\alpha )=\cos (\iota \alpha )\), \(1+\cos (\alpha )=2\cos ^{2} (\frac{\alpha }{2} )\), and \(\cos (\alpha )+\cos (\beta )=2\cos (\frac{\alpha +\beta }{2} )\cos (\frac{\alpha -\beta }{2} )\), we get
Since
and
we get
This implies
Consider
This implies
By substituting (6) into (5) we get
This implies
Using \(\sin ^{2} (\frac{a}{2} )=\frac{1-\cos a}{2}\) and \(\sin ^{2} (\frac{3a}{2} )=\frac{1-\cos 3a}{2}\), we get
Simplifying and using \(\cos a-\cos b=-2\sin (\frac{a+b}{2} )\sin ( \frac{a-b}{2} )\), we get
This implies
In a similar way, putting \(\mu _{\ell +1}=\cosh (\frac{\theta }{2^{\ell +1}} )\) and applying \(\sinh (\alpha )=-\iota \sin (\iota \alpha )\), \(\cosh (\alpha )=\cos (\iota \alpha )\), \(1+\cos (\alpha )=2\cos ^{2} (\frac{\alpha }{2} )\), \(\sin (\alpha )+\sin (\alpha )=2\sin (\frac{\alpha +\beta }{2} )\cos (\frac{\alpha -\beta }{2} )\), \(\sin ^{2} (\frac{\alpha }{2} )=\frac{1-\cos \alpha }{2}\), \(\sin ^{2} (\frac{3\alpha }{2} )=\frac{1-\cos 3\alpha }{2}\), and \(\cos \alpha -\cos \beta =-2\sin (\frac{\alpha +\beta }{2} )\sin (\frac{\alpha -\beta }{2} )\), we have following lemma.
Lemma 3.6
Let \(q^{\ell }_{n}=\sinh (\frac{n\theta }{2^{\ell }} )\) for \(-1\leq n\leq 2^{\ell }N+1\), \(l\geq 0\). Then \(q^{\ell +1}_{2n+1}=\sinh (\frac{(2n+1)\theta }{2^{\ell +1}} )\).
Using Lemmas 3.4–3.6, we get following theorems.
Theorem 3.8
Let \(q^{\ell }_{m}=\cosh (\frac{m\theta }{2^{\ell }} )\) and \(q^{\ell }_{n}=\cosh (\frac{n\theta }{2^{\ell }} )\) for \(-1\leq m\), \(n\leq 2^{\ell }N+1\), \(l\geq 0\). Then
Theorem 3.9
Let \(q^{\ell }_{m}=\cosh (\frac{m\theta }{2^{\ell }} )\) and \(q^{\ell }_{n}=\sinh (\frac{n\theta }{2^{\ell }} )\) for \(-1\leq m\), \(n\leq 2^{\ell }N+1\), \(l\geq 0\). Then
Theorem 3.10
Let \(q^{\ell }_{m}=\sinh (\frac{m\theta }{2^{\ell }} )\) and \(q^{\ell }_{n}=\sinh (\frac{n\theta }{2^{\ell }} )\) for \(-1\leq m\), \(n\leq 2^{\ell }N+1\), \(l\geq 0\). Then
4 Numerical results
In this section, we present several numerical examples to check the performance and show that the proposed SS reconstruct conics.
4.1 Reproduction of fundamental images
In this section, we have implemented our proposed SS on 10 different examples, which support our theoretical analysis. We observe that the fundamental images can be reconstructed by using our method if the control points are taken from these images.
Example 1
By using the control points presented in Fig. 2(a),
for \(m=0,1,2,\ldots ,\eta \), \(n=0,1,2,\ldots ,2\eta -1\), \(\eta =7\), the limiting smooth sphere obtained by the proposed SS is shown in Fig. 2(c), Similarly, the limiting ellipsoid generated in Fig. 3(c), whose control mesh points are
\(m=0,1,2,\ldots,\eta \), \(n=0,1,2,\ldots,2\eta -1\), \(\eta =7\), is shown in Fig. 3(a).
Example 2
By using the mesh with initial points
and
we get the limiting cylinder and cone shown in Figs. 4(c) and 5(c), respectively.
Example 3
The control mesh of torus is presented in Fig. 6(a) with initial points
\(m,n=0,1,2,\ldots,\eta \), \(\eta =8\), whereas the smooth surface after first subdivision step and the limiting surface of torus are given in Figs. 6(b) and 6(c), respectively.
Example 4
The control meshes of upper and lower hyperboloid surfaces are given in Fig. 7(a) with initial points
where \(m=-\eta ,\ldots,0,\ldots,\eta \) and \(n=0,1,2, \ldots, 2\eta \), \(\eta =4\) with \(a=b=1\), \(c=1\) (i.e., for upper hyperbola) and \(c=-1\) (i.e., for lower hyperbola). The limiting hyperbolas are shown in Fig. 7(c).
Example 5
The limiting surface of shell and strip constructed by our SS are presented in Figs. 8(c) and 9(c), whereas their control points
for \(m=0,1,2,\ldots,\eta \), \(n=0,1,2,\ldots,\eta -4\), \(\eta =6\), and
are shown in Figs. 8(a) and 9(a). Figure 10 indicates the impact of parameters on the shapes produced by trigonometric and hyperbolic SSc.
5 Conclusion
In this paper, by using the tensor product we extended the four-point univariate nonstationary SS to a unified bivariate nonstationary SS for regular meshes. Recall that the bivariate SS with the tensor product is obtained starting from the unified SS, which can generalize quite several existing SSs, including the Kobbelt [1] scheme as \(k\rightarrow \infty \) for \(\mu _{\ell +1}\) and \(\mu _{\ell +1}=1\). Weobserved from the examples that the proposed bivariate SS is suitable to generate different images and texture of the geometric object. Local and adaptive refinement within the domain of image parameter can also be easily applied as the unified univariate SS can generate many classical images, such as classical, analytical, and parametric surfaces. Applications of the univariate SS are not confined for closed meshes; in fact, it works for open meshes as well.
Some properties of the SS are:
-
It can reconstruct polynomial, cosine, sine, hyperbolic cosine, and hyperbolic sine functions
-
It can be considered as counterpart of the four-point DD SS [18] in one dimension for \(\mu _{\ell +1}=1\) and, in the limiting case, of trigonometric and hyperbolic functions when the data is constant along the other directions.
Availability of data and materials
None.
References
Kobbelt, L.: Interpolatory subdivision on open quadrilateral nets with arbitrary topology. Comput. Graph. Forum 15(3), 409–420 (1996)
Dyn, N., Levin, D.: Stationary and non-stationary binary subdivision scheme. In: Lyche, T., Schumaker, L.L. (eds.) Mathematical Methods in Computer Aided Geometric Design II, pp. 209–216. Academic Press, New yark (1992)
Yonggang, L., Guozhao, W., Xunnian, Y.: Uniform trigonometric polynomial B-spline curves. Sci. China 45(5), 335–343 (2002)
Dyn, N., Levin, D., Gregory, J.A.: A 4-point interpolatory subdivision scheme for curve design. Comput. Aided Geom. Des. 4, 257–268 (1987)
Jena, M.K., Shunmugaraj, P., Das, P.C.: A non-stationary subdivision scheme for curve interpolation. ANZIAM J. 44(E), 216–235 (2003)
Beccari, C., Casciola, G., Romani, L.: A non-stationary uniform tension controlled interpolating 4-point scheme reproducing conics. Comput. Aided Geom. Des. 24(1), 1–9 (2007)
Daniel, S., Shunmugaraj, P.: An interpolating 6-point \(C^{2}\) non-stationary subdivision scheme. J. Comput. Appl. Math. 1, 164–172 (2009)
Conti, C., Romani, L.: A new family of interpolatory non-stationary subdivision schemes for curve design in geometric modeling. In: Numerical Analysis and Applied Mathematics. International Conference, pp. 523–526 (2010). https://doi.org/10.1063/1.3498528
Bari, M., Mustafa, G.: A family of 4-point n-ary interpolating scheme reproducing conics. Am. J. Comput. Math. 3, 217–221 (2013)
Mustafa, G., Ashraf, P.: A family of 4-point odd-ary non-stationary subdivision schemes. SeMA J. 67, 77–91 (2015)
Zorin, D.: A method for analysis of \(C^{1}\)-continuity of subdivision surfaces. SIAM J. Numer. Anal. 37, 1677–1708 (2000)
Ghaffar, A., Ullah, Z., Bari, M., Nisar, K.S., Al-Qurashi, M.M., Baleanu, D.: A new class of 2m-point binary non-stationary subdivision schemes. Adv. Differ. Equ. 2019, 325 (2019)
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, 171 (2019)
Ghaffar, A., Bari, M., Ullah, Z., Iqbal, M., Nisar, K.S., Baleanu, D.: A new class of 2q-point nonstationary subdivision schemes and their applications. Mathematics 7(7), 639 (2019)
Ashraf, P., Sabir, M., Ghaffar, A., Nisar, K.S., Khan, I.: Shape-preservation of ternary four-point interpolating non-stationary subdivision scheme. Front. Phys. 7, 241 (2020)
Ashraf, P., Ghaffar, A., Baleanu, D., Sehar, I., Nisar, K.S., Khan, F.: Shape-preserving properties of a relaxed four-point interpolating subdivision scheme. Mathematics 8, 806 (2020)
Ashraf, P., Nawaz, B., Baleanu, D., Nisar, K.S., Ghaffar, A., Khan, M.A.A., Akram, S.: Analysis of geometric properties of ternary four-point rational interpolating subdivision scheme. Mathematics 8, 338 (2020)
Deslauriers, G., Dubuc, S.: Symmetric iterative interpolation processes. Constr. Approx. 5, 49–68 (1989)
Reif, U.: A unified approach to subdivision algorithms near extraordinary vertices. Comput. Aided Geom. Des. 12, 153–174 (1995)
Fang, M., Ma, W., Wang, G.: A generalized surface subdivision scheme of arbitrary order with a tension parameter. Comput. Aided Des. 49, 8–17 (2014)
Ghaffar, A., Iqbal, M., Bari, M., Muhammad Hussain, S., Manzoor, R., Nisar, K.S., Baleanu, D.: Construction and application of nine-tic B-spline tensor product SS. Mathematics 7(8), 675 (2019)
Acknowledgements
None.
Funding
None.
Author information
Authors and Affiliations
Contributions
All the authors contributed equally. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Bari, M., Mustafa, G., Ghaffar, A. et al. Construction and analysis of unified 4-point interpolating nonstationary subdivision surfaces. Adv Differ Equ 2021, 72 (2021). https://doi.org/10.1186/s13662-021-03234-x
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13662-021-03234-x