- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Abstract and Applied Analysis

Volume 2012 (2012), Article ID 264137, 23 pages

http://dx.doi.org/10.1155/2012/264137

## Convergence Analysis of Regular Dynamic Loop-Like Subdivision Scheme

School of Computer Science and Technology, Jiangsu Normal University, Xuzhou 221116, China

Received 26 October 2012; Accepted 2 December 2012

Academic Editor: Xiaodi Li

Copyright © 2012 Xiangjun Zhao 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.

#### Abstract

This paper is concerned with the regular dynamic loop-like subdivision scheme based on the extension of Box-Spline method. The purpose of the addressed problem is to prove the convergence of the subdivision scheme and verify the and continuity by calculating the eigenvalues of the 2-neighbor subdivision matrix. Compared with the loop subdivision scheme in previous references, the designed scheme can generate exact revolving surfaces and hold a stronger modeling capability because the subdivision matrix can update regularly with the iteration procedure. Finally, some examples are given to illustrate the effectiveness of the proposed method.

#### 1. Introduction

It is well known that the subdivision method is a powerful tool in the fields of free-form surface modeling and tensor product surfaces for a long time. Starting from an arbitrary initial control mesh, subdivision schemes can produce a sequence of finer and finer meshes converging to a originally described surface. If the sequence of control nets converges in a certain sense, such procedure can be used to generate surfaces. The subdivision operations are efficient and could be well applied to arbitrary topology polygon meshes. In addition, there exist adequate theoretical tools for analyzing its convergence and continuity. Therefore, the subdivision method has become a standard technique in both academic and industrial communities.

In recent decades, there has been a tremendous progress in scheme construction [1–3]. Since the introduction of Catmull-Clark subdivision surfaces [4] at the end of the 1970s, many subdivision schemes have been proposed for various applications [5–8]. A unified framework with various essential and basic refinement operations has also been constructed in [9]. Recently, a subdivision method for triangle meshes has become an important research issue, because such meshes are well supported by software and hardware graphics systems and can be easily derived by most other representations. It is well known that the loop scheme originally proposed by Charles [8, 10] is a simple face-split approximation scheme for triangle meshes. Based on the triangular splines, the scheme produces surfaces which are always continuous everywhere except at the extraordinary vertices where they are only continuity. Boundary rules produce a cubic spline curve along the boundary, which only depends on control points on the boundary. An interior vertex with valence 6 and a boundary vertex with valence 4 are called as a regular vertex, while the others are irregular or extraordinary ones. The masks for the Loop scheme is shown in Figure 1. The scheme works as follows. (i)Vertex updating rule: for every original vertex, a new vertex is calculated by using the suitable coefficients for 1-neighbor control points as shown in Figures 1(a), 1(c), and 1(d). (ii)Edge splitting rule: for every edge in the original mesh, a new vertex is calculated by using the masks as shown in Figure 1(b). (iii)Face splitting rule: every triangle in the original mesh produces six new vertices, three from original vertices and the others from original edges. These six vertices are constructed into four new triangles.

The common feature of these methods lies in their parameters which are fixed in each step of subdivision operation, which is called as stationary subdivision. Unfortunately, since the shape of a stationary subdivision surface is totally determined by control meshes, it is not convenient to add further control except mesh modification. Hence, some nonstationary subdivision schemes should be introduced; for example, the authors in [11] extended the Doo-Sabin scheme to the nonstationary case and [12] proposed a nonstationary butterfly interpolatory subdivision scheme. However, the previous subdivision scheme cannot accurately represent some ordinary surfaces in engineering, such as cylinder, cone, or other revolving surfaces. In order to find a subdivision uniform method to represent quadric surfaces, revolve surfaces, and traditional subdivision ones, [13] proposed a method called semistationary subdivision, which can remedy the shortage of the traditional ones well. But, the above method can only be applied to the quadrilateral mesh and needs the further study for the triangle mesh. So, it is an urgent issue to find a subdivision method for triangle meshes to represent quadric surface, revolving surface, and traditional subdivision surface uniformly.

On the other hand, the convergence is an important topic when studying subdivision surfaces. Doo and Sabin [5] first performed the convergence analysis by investigating the eigenstructure of subdivision matrices based on a discrete Fourier transformation. Ball and Storry [14] further exploited an approach based on the matrix eigenstructure for a tangential continuity analysis. However, their results could not guarantee that subdivision surfaces were regular at extraordinary vertices because it did not take the properties of basis functions into account [15]. For this, Reif [9] explored a method to deal with the continuity issue by establishing a characteristic map, which could be used to ensure the continuity for subdivision schemes. Under the above framework, Peters and Reif [16] established a strict theoretical analysis about both the Doo-Sabin scheme and the Catmull-Clark one, while Umlauf [17] thoroughly examined the continuity of the Loop subdivision scheme. The approach described in [18] is an extension of Reif's work for subdivision schemes without a closed parametric form. In [19], Zorin proposed another method based on Z-polynomials when considering the continuity of arbitrary subdivisions and developed a numerical algorithm for the continuity verification. However, because the regular dynamic subdivision matrix is not fixed, it is impossible to use the classic criterion for subdivision convergence.

Motivated by the above discussion, we will investigate the subdivision method for triangle mesh which can represent a revolving surface exactly. Firstly, a new subdivision scheme based on Box-Splines is proposed, and the subdivision matrix is constructed. Secondly, the characteristic spectrum of global subdivision matrix is analyzed, and the detailed analysis for and continuity is given. Finally, several illustrative examples are provided to demonstrate the effectiveness of the proposed approach.

The main contribution of this paper is summarized as follows. (1) A novel subdivision scheme with a stronger modeling ability is proposed based on the new extended Box-Splines. (2) The and continuity is strictly proved by calculating the characteristic spectrum of the global subdivision matrix. (3) An anisotropy subdivision scheme and a special control net pattern are constructed, and then the revolving surface is generated exactly.

#### 2. Regular Dynamic Loop-Like Subdivision Scheme

In this section, we will introduce the regular dynamic loop-like subdivision scheme. Similar to the loop scheme, after one step of subdivision, the number of irregular vertices is fixed. If the mesh is further subdivided, irregular vertices will be isolated. In other words, each face contains at most one irregular vertex. In the following, we will assume that the sufficient subdivision steps have finished to generate the local subdivision structure just as shown in Figure 2. The vertex marked as is an irregular vertex with valence . Its neighbors are separated by incident edges into subregions, which are called as segments and marked in counterclockwise order. In each segment, from center to outside, the control vertices are also numbered in counterclockwise order. After times subdivision, the vertex sequence around the irregular vertex is denoted as where is the vertex subsequence in segment .

For L-level neighbors, . In order to analyze the first order continuity, we consider the 2-level vertex neighbors of the irregular vertex, that is, . Here, we define .

Similar to the loop subdivision schemes [8], two successive vertex sequences hold the following relationship: where is a matrix related to the subdivision level index . Obeying the former segmented control vertices coding rules, the subdivision matrix is made up of matrix blocks which size is . Thus, we have

The subdivision matrix has the following properties.(1)The sum of elements of each row is equal to 1.(2)The matrix is cyclic symmetry, that is,

Based on the property (2), (2.2) can be rewritten as where

Based on the -Box-Splines [20–22], the generation function of a regular dynamic loop-like subdivision [13] and each parameter of the above formula could be obtained as follows: where the kernel function is chosen as Of course, the kernel function could be some others with the same or faster convergence rate.

It is known that the characteristic spectrum of is needed when studying the convergence of the subdivision scheme [9]. Next, we will analyze the characteristic spectrum of in detail.

For the block circulant matrix where , we denote , , , and for simplicity.

Let which is indeed a similarity transformation of matrix .

Denote where .

Then, we have the following Lemma.

Lemma 2.1. *The matrices and have the same eigenvalues.*

The above lemma is easy to be verified (see [23] for details) and we omit its proof here.

Theorem 2.2. *The eigenvalues of the subdivision matrix
**
are , , , and , where , and is the Kronecker delta.*

*Proof. *Let
By (2.11), we have

Hence, the eigenvalues of the submatrix are , , , and . The eigenvalues of the submatrix are , , and .

Then, we can obtain the eigenvalues of as follows:

#### 3. Analysis on Convergence of the Subdivision Scheme

In this section, we mainly focus on the convergence of the subdivision case around irregular vertices. At the regular vertices, the generated surfaces have similar properties as the -Box-Splines in [22], which is continuity. In the following, the convergence of the subdivision scheme will be firstly discussed, and then the continuity of the subdivision surfaces.

##### 3.1. Convergence of the Subdivision Scheme

In this subsection, we will analyze the convergence of regular dynamic loop-like subdivision scheme. The subdivision process can be expressed as Let By induction, we can conclude that the sum of each row of is equal to 1.

Define , and , by (2.7), we have where is the row number of the matrix.

When , we have where is a constant number.

Theorem 3.1. *If subdivision step and the kernel function converges to 1 with a geometric series rate, then a regular dynamic loop-like subdivision scheme is convergent.*

*Proof. *Under an identical transformation to , we get
For the dimensional column vector , the is convergent. Next, we only need to prove that and are convergent.

First of all, let , where is the th component of . Since all elements of the matrix are nonnegative and the sum of the row element is always equal to 1, we have
Thus, we have

By (3.4), we get
where is a constant.

Secondly, let
We claim that is Cauchy sequence and prove it as follows.

For , one has

Denote , we have for some , where are the eigenvectors of . Then,

Using the standard results in a numerical analysis, we get
where and are row sum norms of and , respectively. is the transformation, which transforms the basis of to the basis of .

Then, by (3.4), (3.8), and (3.11), we have
where is a constant.

Similarly, we have
where also is a constant.

By Theorem 2.2 and (2.7), one obtains

Substituting (2.4), (3.8), and (3.14) into (3.10), we obtain
From , then both and are convergent.

Then we get
that is to say, is a Cauchy sequence, that is, is convergent. Hence, the subdivision scheme is convergent.

##### 3.2. Continuity of the Subdivision Surface

###### 3.2.1. Subdivision Matrix Analysis

Firstly, we need to prove the following lemma.

Lemma 3.2. *Let
**
Their eigenvalues are
*

*Proof. *Since
where , and
then
From
we have
Furthermore, their eigenvalues could be obtained as follows:

Theorem 3.3. *The eigenvalues of are , , , , and , and the last two eigenvalues are the repeated ones.*

*Proof. *Since is a block circulant matrix, so is . Let
we know is a block circulant matrix, and

Denote
we have
and the eigenvectors of only relate to . The following two cases need to be discussed separately.

(1) If , then

By Lemma 3.2, we can get the eigenvalues of :
The eigenvalues of are

(2) If , then
where , are real numbers. Their eigenvalues are
respectively.

Theorem 3.4. *If the eigenvalues of matrix are ordered from the greatest to the least, then one has
*

*Proof. *Since each row sum of is equal to 1, then must be one of eigenvectors corresponding to the eigenvalue 1.

(1) We prove the (3.35) firstly.

Let
It is easy to derive that

In order to prove that the absolute value of is the maximum value among all eigenvalues except for , we need to prove
and then

(a) For the inequality (3.39), if , the group has eigenvalues and , then the inequality is obvious to be obtained. If , since
and according to the monotonicity of the function , we have that
is the maximum value in the group.

(b) For the inequality (3.40), we only need to prove
where

When , we have
Then,
Since , the above formula is positive; that is, when , inequality (3.40) holds.

When , since
that is
then we have
By again, the conclusion could be obtained naturally.

To Sum up, we have

(c) For the inequality (3.41), we have
Since
and , we have

From
we have

Then, the eigenvalues of hold the properties (2). That is to say, , and .

(2) We verify (3.36).

Since
we have
and ; thus we have .

Now, the proof of Theorem 3.4 is completed.

###### 3.2.2. Continuity

Theorem 3.5. *If the kernel function has the convergence rate as Theorem 3.3, then the subdivision surface is continuous.*

*Proof. *Let
where , denotes direct a product, and is an undetermined triple coefficient.

Since
where , and . By Theorems 3.3 and 3.4, we have, when is convergent and is unique.

Let

Given any two points whose coordinates are th, th, component of , denoted as , we have
By (3.60), we have
That is to say that the subdivision surface is continuity.

###### 3.2.3. Continuity

Based on the above result, we analyze the continuity of loop-like subdivision surface.

Theorem 3.6. *If the kernel function has the convergence rate as Theorem 3.1, then the subdivision surface is tangent plane continuity, that is, continuity.*

*Proof. *We will verify that there exists a common tangent plane around vertex so as to ensure that the subdivision surface is continuity.

Given any three points whose coordinates are th, th, and th component of , denoted as , and , by Theorem 3.4, we have
Let
we have
Similarly, we have
Then,
Hence, when , the vertex around the has a common normal vector. That is to say that the subdivision surface is continuity.

###### 3.2.4. Continuity

According to [18], besides the eigenvalues of satisfy (3.35), the characteristic maps associated with should be regular and injective for obtaining global continuity. The characteristic map is defined as the subdivision surface generated by refining an initial mesh whose topological structure is identical with the subdivision stencil [24], just as shown in Figure 2. If both and are real, the horizontal and longitudinal coordinates of the th control point of the initial control mesh come from the corresponding elements of the eigenvectors of and , and the vertical coordinate is assumed to be zero, respectively.

The regularity and injectivity of this map can be judged from the triangulation obtained from the control points by some steps subdivision [25]. Similar to many other studies, this paper only gives numerical evidence to verify the regularity and injectivity of the characteristic map of the loop-like subdivision scheme. The characteristic maps with valences are verified and they all hold a good shape. The obtained results are presented in Figure 3.

#### 4. Experiments

In this section, we show several examples of subdivision surface generated by our schemes. Figure 4 depicts three examples. Figures 4(a), 4(c), and 4(e) are control meshes, and Figures 4(b), 4(d), and 4(f) are subdivision surfaces. It is well known that the revolving surface is very important in industrial application. In our schemes, it is easy to create the local revolving part. As shown in Figure 5, a regular control mesh can be constructed for the revolving part. Set , , , and , an exact revolving surface can be obtained by the subdivision mask as Figure 1 and the compensation mask as Figure 5(b). Certainly, the sweep line direction of the revolving surface should be set interactively. Figure 6 depicts two other examples with the revolving part. Figures 6(a) and 6(e) are control meshes, and Figures 6(b), 6(c), 6(d), and 6(f) are subdivision surfaces. Figures 6(b) and 6(c) show the result surfaces after one and two subdivision step(s), respectively. The subdivision surface with texture is shown in Figure 6(d). Both the vase in Figure 6(d) and the bolt hole in Figure 6(e) are revolving parts. Using our scheme, the exact revolving parts can be generated easily. The results demonstrate that our technique can be an alternative solution for representing the revolving shape exactly.

#### 5. Conclusions

This paper has presented a regular dynamic loop-like subdivision scheme that can be regarded as an extension of the -Box-Splines. The scheme adopts a regular dynamic subdivision operator, which is convergent and versatile. The obtained surface is continuity and could meet the requirement of industrial application. In contrast to the traditional Loop subdivision method, the subdivision scheme is more flexible and has a stronger modeling ability. Under reasonable and appropriate adjustments, the method proposed in this paper could generate a revolving surface exactly.

In the present paper, we only consider the continuity of the isotropic schemes, and some more general cases should be further investigated. Moreover, only numerical discussions are presented to demonstrate the continuity in this paper, and some more sophisticated analyses are necessary for further considering.

#### Acknowledgments

The research is partially supported by the National Natural Science Foundation of China under Grant nos. 61272297, 11226146, the Doctoral Fund of Ministry of Education of China under Grant no. 20090450613, and the Natural Science Foundation of the Jiangsu Higher Education Institutions under Grant no. 12KJB120002.

#### References

- H. Prautzsch and Q. Chen, “Analyzing midpoint subdivision,”
*Computer Aided Geometric Design*, vol. 28, no. 7, pp. 407–419, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - D. Zorin, P. Schroder, and W. Sweldens, “Interpolating subdivision for meshes with arbitrary topology,” in
*Proceedings of the Computer Graphics Conference (ACM SIGGRAPH '96)*, pp. 189–192, August 1996. View at Scopus - X. Li and J. Zheng, “An alternative method for constructing interpolatory subdivision from approximating subdivision,”
*Computer Aided Geometric Design*, vol. 29, no. 7, pp. 474–484, 2012. View at Publisher · View at Google Scholar - E. Catmull and J. Clark, “Recursively generated B-spline surfaces on arbitrary topological meshes,”
*Computer-Aided Design*, vol. 10, no. 6, pp. 350–355, 1978. View at Google Scholar · View at Scopus - D. Doo and M. Sabin, “Behaviour of recursive division surfaces near extraordinary points,”
*Computer-Aided Design*, vol. 10, no. 6, pp. 356–360, 1978. View at Google Scholar · View at Scopus - D. Levin, N. Dyn, and J. Gregory, “A butterfly subdivision scheme for surface interpolation with tension control,”
*ACM Transactions on Graphics*, vol. 9, pp. 160–169, 1990. View at Google Scholar - L. Kobbelt, “$\sqrt{3}$-subdivision,” in
*Proceedings of the Computer Graphics Conference (ACM SIGGRAPH '00)*, pp. 103–112, July 2000. View at Scopus - C. Loop,
*Smooth subdivision surfaces based on triangles [M.S. thesis]*, Department of Mathematics, University of Utah, 1987. - U. Reif, “A unified approach to subdivision algorithms near extraordinary vertices,”
*Computer Aided Geometric Design*, vol. 12, no. 2, pp. 153–174, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - J. Sadeghi and F. F. Samavati, “Smooth reverse Loop and Catmull-Clark subdivision,”
*Graphical Models*, vol. 73, no. 5, pp. 202–217, 2011. View at Publisher · View at Google Scholar · View at Scopus - M. K. Jena, P. Shunmugaraj, and P. C. Das, “A non-stationary subdivision scheme for generalizing trigonometric spline surfaces to arbitrary meshes,”
*Computer Aided Geometric Design*, vol. 20, no. 2, pp. 61–77, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - Y. J. Lee and J. Yoon, “Non-stationary subdivision schemes for surface interpolation based on exponential polynomials,”
*Applied Numerical Mathematics*, vol. 60, no. 1-2, pp. 130–141, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - H. Zhang and J. G. Sun, “Weight-based direct manipulation of FFD,”
*Chinese Journal of Computers*, vol. 25, no. 9, pp. 910–915, 2002 (Chinese). View at Google Scholar · View at Scopus - A. A. Ball and D. J. T. Storry, “Conditions for tangent plane continuity over recursively generated b-spline surfaces,”
*ACM Transactions on Graphics*, vol. 7, no. 2, pp. 83–102, 1988. View at Publisher · View at Google Scholar - D. Zorin and P. Schröder, “A unified framework for primal/dual quadrilateral subdivision schemes,”
*Computer Aided Geometric Design*, vol. 18, no. 5, pp. 429–454, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - J. Peters and U. Reif, “Analysis of algorithms generalizing
*b*-spline subdivision,”*SIAM Journal on Numerical Analysis*, vol. 35, no. 2, pp. 728–748, 1998. View at Publisher · View at Google Scholar - G. Umlauf, “Analyzing the characteristic map of triangular subdivision schemes,”
*Constructive Approximation*, vol. 16, no. 1, pp. 145–155, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - D. Zorin, “A method for analysis of ${C}^{1}$-continuity of subdivision surfaces,”
*SIAM Journal on Numerical Analysis*, vol. 37, no. 5, pp. 1677–1708, 2000. View at Publisher · View at Google Scholar - D. Zorin, “Subdivision for modeling and animation,” in
*Proceedings of the Computer Graphics Conference (ACM SIGGRAPH '96)*, ACM Press, New Orleans, La, USA, 2000. - J. Zhang, “C-curves: an extension of cubic curves,”
*Computer Aided Geometric Design*, vol. 13, no. 3, pp. 199–217, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - Y. Lü, G. Wang, and X. Yang, “Uniform trigonometric polynomial B-spline curves,”
*Science in China. Series F*, vol. 45, no. 5, pp. 335–343, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - X. J. Zhao,
*Research on mesh surface modeling [Doctor’s thesis]*, Zhejiang University, 2006. - C. de Boor, K. Höllig, and S. Riemenschneider,
*Box Splines*, vol. 98 of*Applied Mathematical Sciences*, Springer, New York, NY, USA, 1993. - G. Li and W. Ma, “Composite $\sqrt{2}$ subdivision surfaces,”
*Computer Aided Geometric Design*, vol. 24, no. 6, pp. 339–360, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - P. Oswald and P. Schröder, “Composite primal/dual $\sqrt{3}$-subdivision schemes,”
*Computer Aided Geometric Design*, vol. 20, no. 3, pp. 135–164, 2003. View at Publisher · View at Google Scholar