Abstract and Applied Analysis

VolumeΒ 2011Β (2011), Article IDΒ 203453, 22 pages

http://dx.doi.org/10.1155/2011/203453

## Subdivision Depth Computation for Tensor Product -Ary Volumetric Models

Department of Mathematics, The Islamia University of Bahawalpur, Bahawalpur 63100, Pakistan

Received 22 October 2010; Revised 27 January 2011; Accepted 28 February 2011

Academic Editor: YoshikazuΒ Giga

Copyright Β© 2011 Ghulam Mustafa and Muhammad Sadiq Hashmi. 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

We offer computational formula of subdivision depth for tensor product -ary () volumetric models based on error bound evaluation technique. This formula provides and error control tool in subdivision schemes over regular hexahedron lattice in higher-dimensional spaces. Moreover, the error bounds of Mustafa et al. (2006) are special cases of our bounds.

#### 1. Introduction

Subdivision is a simple and elegant method to describe smooth curves and surfaces. The approach of subdivision schemes is simple and efficient due to its mathematical formulation. Its application ranges from industrial design and animation to scientific visualization and simulation. Due to this, subdivision method is becoming a standard technique and now well-understood by both academic and industrial communities. It is an algorithm to generate smooth curves and surfaces as a sequence of successively refined control polygons. At each subdivision level, the subdivision scheme describe the source grid maps to the subdivided grid, which results in increase in the number of points. The number of points inserted at level between two consecutive points from level is called arity of the scheme. In the case when number of points inserted are the subdivision schemes are called binary, ternary, …, -ary, respectively. For more details on -ary subdivision schemes, we may refer to [1–4] thesis of Aspert [5] and Ko [6].

However tensor product trivariate schemes obtained from above schemes have been proven themselves an excellent tool for the modeling of largely regular volumetric/solid models over hexahedron lattice, for example, manufacturing of industrial regular block, font animation and garment pressures for the biomechanical design of functional apparel products, and so forth.

Although subdivision has many attractive advantages for modeling purposes, it has received far less attention in volumetric modeling. One of the reason is the topological complexity of domain meshes in higher-dimensional spaces. Another reason is lack of proper mathematical tools for extraordinary analysis. Even so, it is clear that subdivision is slowly gaining interest in solid modeling community. MacCracken and Joy [7] proposed a tensor product extension of the Catmull-Clark scheme in the volumetric setting over hexahedron lattice. Later on, Bajaj et al. [8] further extended the scheme with the analysis based on numerical experiments. In 2004, McDonnell et al. [9] present a volumetric subdivision scheme for interpolation of arbitrary hexahedral meshes. Mustafa and Liu [10] present subdivision scheme which exhibits control over shrink-age/size of volumetric models in 2005. The method here presented is much simpler and easier as compared to MacCracken and Joy [7]. Cheng and Yong [11] proposed subdivision scheme based on nonhexahedron lattice. Wang et al. [12] gave the application of the volumetric subdivision scheme in the simulation of elastic human body deformation and garment pressure.

Subdivision schemes have become important in recent years because they provide a precise and efficient way to describe smooth curves/surfaces/volumetric models, however the little have been done in the area of error control for tensor product -ary volumetric models. The investigation of error control for volumetric models arises two questions in mind.(i)*How well the regular hexahedron lattice approximate to the limit volumetric model?*(ii)*How many subdivision steps are needed to satisfy a user-specified error tolerance?*

For given error tolerance, the subdivision levels performed on the initial control polygon, so that the error/distance between the resulting control polygon and the limit volumetric models would be less than the error tolerance is called subdivision depth.

A subdivision depth and error bound based on forward differences of control points have been presented by [11, 13–18], while the methods [19–22] are based on eigenanalysis. But nothing in this area has been done for more general tensor product -ary volumetric models yet. In this paper, we will answer-above-said questions and present a subdivision depth computation technique based on error bounds for tensor product -ary volumetric models.

It is notified that the increase in arity offers greater freedom than offered by low arity subdivision volumetric scheme in term of coefficients. Higher arity volumetric schemes allow a range of different behaviors than the lower arity volumetric schemes. Ko [6] notified that subdivision curves/surfaces with higher arity results in higher smoothness and approximation order but smaller in support, which make it more practical in use. It is also noticed that higher arity volumetric models have slightly lower computational cost than lower arity volumetric models. This discussion motivate us to calculate error bound and depth for higher arity subdivision volumetric models, that is, in general for tensor product -ary subdivision volumetric models. Our method is generalization of Mustafa et al. [13, 15–17]. The paper is arranged as follows.

Section 2 is devoted for basic definitions and notations. In Section 3, we have computed subdivision depth for tensor product -ary volumetric models. Section 4 presents applications of our results for tensor product -ary volumetric models. Conclusion and future research directions are given in Section 5. The typical mathematical proofs are placed in Appendices A and B for improved presentation of the paper.

#### 2. Preliminaries

In this section, first we list all the basic facts about subdivision curve, surface and volumetric models needed in this paper. Then we settle some notations for fair reading and better understanding of Section 3.

##### 2.1. Concepts

###### 2.1.1. -Ary Subdivision Curve

Given a sequence of control points , , , where the upper index indicates the subdivision level, an -ary subdivision curve [5] is defined by where and The set of coefficients is called subdivision mask. Given initial values , , then in the limit , the process (2.1) defines an infinite set of points in . The sequence of control points is related, in a natural way, with the dyadic mesh points , . The process then defines a scheme whereby replaces the value for . Here is inserted at the mesh point for . Labelling of old and new points is shown in Figure 1 which illustrates subdivision scheme (2.1).

###### 2.1.2. Tensor Product -Ary Subdivision Surface

Given a sequence of control points , , , where the upper index indicates the subdivision level, a tensor product -ary surface is a tensor product of (2.1) defined by where satisfies (2.2). Given initial values , , then in the limit , the process (2.3) defines an infinite set of points in . The sequence of values is related, in a natural way, with the dyadic mesh points , . The process then defines a scheme whereby replaces the values for . Here the values are inserted at the mesh points for . Labelling of old and new points is shown in Figure 2 which illustrates subdivision scheme (2.3).

###### 2.1.3. Tensor Product -Ary Volumetric Model

Given a sequence of control points , , , where the upper index indicates the subdivision level, a tensor product -ary volumetric model is tensor product of (2.3) defined by where satisfies (2.2). Given initial values , , then in the limit , the process (2.4) defines an infinite set of points in . The sequence of values is related, in a natural way, with the dyadic mesh points , . The process then defines a scheme whereby replaces the values for . Here the values are inserted at the mesh points for . Labelling of old and new points is shown in Figure 3 which illustrates subdivision scheme (2.4).

###### 2.1.4. Subdivision Depth

Given control polygon of tensor product -ary volumetric model and an error tolerance , if we subdivide control polygon times so that the error between resulting polygon and volumetric model is smaller than , then is called subdivision depth of tensor product -ary volumetric model with respect to .

##### 2.2. Notations

Here, we assume where Suppose further for , Assume where Furthermore, suppose

#### 3. Depth for Tensor Product -Ary Volumetric Models

In this paragraph, we compute subdivision depth for tensor product -ary volumetric model. Moreover, we show that error bound for binary subdivision volumetric models [17] is special case of our bound. Here we need following lemmas for Theorem 3.5. The proof of first two lemmas are shown in Appendices A and B, respectively.

Lemma 3.1. *Given initial control polygon , , let the values , be defined recursively by (2.4) together with (2.2), then
**
where and , , are defined by (2.5) and (2.8), respectively.*

Lemma 3.2. *Given initial control polygon , , let the values , be defined recursively by (2.4) together with (2.2), then
**
where , , for are defined by (2.5), (2.7), (2.9)–(2.16), respectively.*

Lemma 3.3. *Given initial control polygon , , let the values , be defined recursively by (2.4) together with (2.2). Suppose is the piecewise linear interpolant to the values and is the limit volumetric model of (2.4). If , then error bound between tensor product -ary volumetric model and its control polygon after -fold subdivision is
**
where and are defined by (2.5) and (2.18), respectively.*

* Proof. *Let denote the uniform norm. Since the maximum difference between and is attained at a point on the th mesh, we have
where is defined by (2.7). By (3.2) and (3.4), we get
where and are defined by (2.5) and (2.18), respectively.

By triangle inequality we get (3.3). This completes the proof.

*Remark 3.4. *Theorem 3.10 in [17] is designed to estimate error bound for binary subdivision volumetric model (i.e., each cube is divided in 8 subcubes). But for the higher arity subdivision schemes such as for (when each cube is divided in subcubes) error estimates are not feasible by existing result. So estimation of error bounds for tensor product -ary volumetric model is quite necessary. Our Lemma 3.3 provides freedom to evaluate error bound for all arities. Here we also mention that Lemma 3.3 for reduces to [17, Theorem 3.10].

Now we offer the computational formula of subdivision depth for tensor product -ary volumetric model.

Theorem 3.5. *Let be subdivision depth, and let be the error bound between tensor product -ary volumetric model and its -level control polygon . For arbitrary , if
**
then
*

* Proof. *From (3.3), we have
This implies, for arbitrary given , when subdivision depth satisfies the following inequality:
then
This completes the proof.

#### 4. Applications

##### 4.1. Error Bound and Subdivision Depth of Tensor Product -Ary Interpolating Volumetric Models

In this section, we estimate the error bound and subdivision depth of -point tensor product -ary interpolating volumetric models. By taking the tensor product of -point -ary scheme of [4], we get the following: where , and stands for -ary interpolating subdivision volumetric model, that is, stands for binary, ternary, quaternary and so on, respectively.

The error bounds and subdivision depth of (4.1) are shown in Tables 1 and 2, respectively. In these tables, we have shown the error bounds and depth of different arity interpolating subdivision volumetric models by using Lemma 3.3 and Theorem 3.5 with .

##### 4.2. Error Bound and Subdivision Depth of Tensor Product -Ary Approximating Volumetric Models

In this section, we estimate the error bound and subdivision depth of tensor product -point -ary approximating volumetric models. By taking the tensor product of -point -ary scheme of [4], we get the following: where , , and stands for -ary approximating subdivision volumetric model, that is, stands for binary, ternary, quaternary, and so on, respectively.

The error bounds and subdivision depth of (4.3) are shown in Tables 3 and 4, respectively. In these tables, we have shown the error bounds and depth of different arity approximating subdivision volumetric by using Lemma 3.3 and Theorem 3.5 with .

#### 5. Conclusion and Future Work

We have computed subdivision depth based on error bounds for tensor product -ary volumetric models. Furthermore, we have shown that error bounds for binary subdivision volumetric model [17] is special case of our bounds. It is noticed that the increase in arity results gradually decrease in error, which is shown in Tables 1, 3 and graphically in Figure 4. It is noticed from Tables 2 and 4 that higher arity subdivision volumetric models need less number of subdivision steps than lower arity to satisfy user-specified error tolerance.

The authors are looking, as a future work, to extend the computational techniques of subdivision depth for -ary arbitrary subdivision volumetric models over rectangular/triangular hexahedron lattice. we will discuss them elsewhere.

#### Appendices

#### A. Proof of Lemma 3.1

* Proof. *From (2.2), (2.4) for , we obtain
where is defined by (2.6) and .

Now using (A.1) recursively together with notations defined by (2.8), we get
From (2.5) and using the above inequality, we get
Again using (A.2)–(A.4) recursively and by utilizing (2.5) and (2.8), we have
Further using (A.5)–(A.8) recursively and by utilizing (2.5) and (2.8), we have
Similarly, using (A.9)–(A.12) recursively together with (2.5) and (2.8) separately for each , respectively, we have
This completes the proof.

#### B. Proof of Lemma 3.2

* Proof. *From (2.2) and (2.4),
By expanding innermost summation, we get
where is defined by (2.16). Now
Since
then (B.3) implies
Substituting it into (B.1), we get
Since
then substituting these summations into (B.6) and rearranging, we get
where
This implies
where and , are defined by (2.7) and (2.8). Now using notations (2.5) and (2.9), we have
Using (2.10)–(2.16) for , we have
Similarly from (2.2) and (2.4) for , ,
Now after expanding and rearranging the above summation, we have
where
Now using notations (2.5), (2.7)–(2.9) and using Lemma 3.1, we have