ISRN Computer Graphics

Volume 2013 (2013), Article ID 434213, 8 pages

http://dx.doi.org/10.1155/2013/434213

Research Article

The Quaternary Interpolating Scheme for Geometric Design

Shahid S. Siddiqi¹ and Muhammad Younis²

¹Department of Mathematics, University of the Punjab, Lahore 54590, Pakistan

²Centre for Undergraduate Studies, University of the Punjab, Lahore 54590, Pakistan

Received 18 February 2013; Accepted 27 March 2013

Academic Editors: A. Castelo, C. Cusano, F. Giannini, C. Joslin, G. Patanè, and C.-M. Wang

Copyright © 2013 Shahid S. Siddiqi and Muhammad Younis. 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.

A novel 4-point interpolating subdivision scheme is presented, which generates the family of limiting curves and its limiting function has support on . It behaves better than classical 4-point binary and ternary schemes with the same approximation order in many aspects that it has smaller support size, higher smoothness, and is computationally more efficient. The proposed nonstationary scheme can reproduce the functions of linear spaces spanned by for . Moreover, some examples are illustrated to show that the proposed scheme can also reproduce asteroids, cardioids, and conic sections as well.

1. Introduction

Subdivision schemes have become one of the most important, significant, and emerging modelling tools in computer applications, medical image processing, scientific visualization, reverse engineering, computer aided geometric designing, and so forth, because of their simple, elegant, and efficient ways to create smooth curves from initial control polygon by subdividing them according to some refining rules, recursively. These refining rules take the initial polygon to produce a sequence of finer polygons converging to a smooth limiting curve.

In the field of nonstationary subdivision schemes, binary and ternary schemes are present in the literature [1–6]. But the quaternary schemes are not discussed as others. The aim of this paper is to introduce a quaternary nonstationary scheme which reproduces the linear functions spanned by . Moreover, the proposed scheme can also generate asteroids, cardioids, and in particular conic sections like circles, ellipses, and so forth. Some properties of the proposed scheme (like support size and symmetry of basic limit function, approximation order, convergence, and smoothness) have also been investigated. Besides the convergence and approximation order, the two important and interesting properties of basic limit function of a subdivision scheme are the support size and the smoothness. They are commonly manipulated with each other in the sense that a higher degree of smoothness generally requires a larger support, thus leading to a more global influence of each initial data value on the limit function. Raising the arity of the subdivision scheme provides a way to overcome this problem to some extent. The proposed scheme has smaller support and higher smoothness than the classical binary 4-point scheme, and all other schemes reproduce cubic polynomials by construction whether they are stationary or nonstationary [1–4, 6, 7].

As interpolating subdivision schemes retain the points of stage as the subset of the points of next stage , thus the structure of a quaternary 4-point interpolating scheme in general form can be written as

where the coefficients and are chosen to satisfy the relations and , respectively, for a large value of .

This paper is organized as follows. In Section 2 the basic notion and definitions of the quaternary subdivision scheme are considered. The construction of the proposed scheme has been shown in Section 3. In Section 4, the convergence and smoothness of the scheme are being calculated using the theory of asymptotic equivalence. The basic limit function and its properties are being discussed in Section 5. The conclusion is drawn in Section 6.

2. Preliminaries

A quaternary subdivision scheme, to generate smooth curves or surfaces, is defined as the limit of refined control polygons or meshes, according to some refinement rules, recursively, in which the set of control points of polygon at level is mapped to a refined polygon to generate the new set of control points at the level by applying the following subdivision rule:

with the sequence of finite sets of real coefficients , constitute the so-called mask of the subdivision scheme. If the mask of a scheme is independent of (namely, if for all ), then it is called stationary ; otherwise it is called nonstationary .

The convergent subdivision scheme with the corresponding mask necessarily satisfies

It follows that the symbol of a convergent subdivision scheme satisfies the conditions

For this, we introduce a symbol called the Laurent polynomial

of a mask with finite support. In view of Dyn [10], the sufficient and necessary conditions for a uniform convergent scheme are defined as follows.

A quaternary subdivision scheme is uniformly convergent if and only if there is an integer , such that

and subdivision with symbol is related to with symbol , where satisfying the property

where and . The norm of a subdivision scheme with a mask , is defined by and

where

The notation of convergence for quaternary subdivision scheme, similar to that given by Dyn and Levin in [11] for a binary scheme, is given in the following.

Definition 1. A quaternary subdivision scheme is said to be convergent if for every initial data there exists a limit function such that

and is not identically zero for some initial data .

Definition 2. Two quaternary subdivision schemes and are said to be asymptotically equivalent if

where

Theorem 3. Let and be quaternary nonstationary and stationary subdivision schemes, respectively, which are said to be asymptotically equivalent if they have finite masks of the same support. If stationary scheme is and

then nonstationary scheme is also .

3. The Nonstationary Subdivision Scheme

In this paper, an interpolating 4-point nonstationary scheme is presented which is associated with Lagrange-like cubic trigonometric interpolants. For this, consider a space for some such that , for the data set, , and also consider the function,

where

is a unique function in which interpolates the data set with having minimum amplitude among other interpolants from [12], where the function is called the trigonometric Lagrange-like interpolant of the previous data. Since the function is defined for , where is represented by , for the following discussion.

(i)If , then

(ii)If , then

and similarly, it can be obtained for the following.(iii)If , then

After that, adjust the previous values to the masks of the subdivision scheme (1) in the following manner:

and also we have

Thus, an interpolating 4-point nonstationary subdivision rule to refine the control polygon is defined in (21), where the mask of proposed scheme satisfies the affine properties, presented by the set of (19) and (20). So, we have

It may be noted that the points , , and lie on the Lagrange-like interpolant of the set of points , and . Moreover, the mask of scheme (21) is bounded by the following coefficients:

The proof of the previous boundedness can be followed from Lemma 4.

4. Convergence and Smoothness

The theory of asymptotic equivalence is used to investigate the convergence and smoothness of the scheme following [11]. For this, some estimations of and used are given in the following lemmas. To prove the lemmas, the following three inequalities are used:

Lemma 4. For and , one has

Proof. To prove the inequality (i)

The proof of (ii), (iii), (iv), (v), and (vi) can be obtained similarly.

Lemma 5. For some constants , and independent of , one has the following:

Proof. Inequality (i) can be proved using Lemma 4. So

The proof of (ii), (iii), (iv), (v), and (vi) can be obtained similarly.

Lemma 6. The Laurent polynomial of the scheme at the level can be written as , where

Proof. Since

therefore using and following result can be established .

Lemma 7. The Laurent polynomial of the scheme can be written as , where

and the subdivision scheme corresponding to the symbol is .

Proof. The mask defined by the scheme converges and has the smoothness (it can be proved using Laurent polynomial method). If is , then with the mask

is .

Theorem 8. The scheme defined by (21) converges and has smoothness .

Proof. To prove the proposed scheme to be , it is sufficient to show that the scheme corresponding to is (Theorem given by Dyn and Levin [13]). Since is by Lemma 7, then following Theorem 3, it has been shown that the schemes and are asymptotically equivalent. So we have to show that

where

From Lemmas 6 and 7, it can be written as

Similarly, one can obtain

From Lemma 5, we have , ,, ,, and . So, it can be written as

Thus, the scheme corresponding to symbol is and hence the scheme (21) is .

Figure 1 shows the reproduction of the unit circle and ellipse by the proposed scheme (21), taking regular hexagon as control points for circle.

(a)

(b)

Figure 1: The reproduction of the unit circle and ellipse by the proposed scheme.

In Figure 2, twelve points have been taken as control points on the parametric curves of asteroid: and cardioid: to reconstruct the asteroid and cardioid, respectively, by the proposed scheme.

(a)

(b)

Figure 2: The reconstruction of asteroid and cardioid by the proposed scheme.

Figure 3 shows the behavior of basic limit function for different values of .

(a)

(b)

Figure 3: Basic limit function of proposed scheme for different values of .

5. Properties of the Scheme

In this section some properties (approximation order, reproduction property, support size, and symmetry of basic limit function) are being discussed. The results show that the proposed scheme with the same approximation order has the higher smoothness and smaller support than the existing 4-point interpolating subdivision schemes (see also Table 1).

Table 1: Comparison of the 4-point interpolating subdivision schemes.

Scheme
Type
Continuity
Approximation order
Support

Binary [8]
Stationary

4
−3, 3

Ternary [9]
Stationary

3
−2.5, 2.5

Proposed (32)
Stationary

4
−2.3, 2.3

Binary [1]
Nonstationary

4
−3, 3

Binary [2]
Nonstationary

4
−3, 3

Ternary [3]
Nonstationary

3
−2.5, 2.5

Ternary [4]
Nonstationary

3
−2.5, 2.5

Proposed (21)
Nonstationary

4
−2.3, 2.3

Another advantage (see also [14]) of the scheme is the computational cost. In one subdivision step, for a sequence of points the proposed scheme requires multiplications and additions. On the other hand, computing the same number of refined points with the binary scheme requires two subdivision steps with a total cost of multiplications and additions, so the quaternary scheme is more efficient.

The basic limit function of the scheme is symmetric about -axis for the data

Theorem 9 (see [3]). The basic limit function is symmetric about the -axis.

Proof. Let denote the basic limit function and define such that restriction of to satisfies for all . The symmetry of basic function is proved using induction on .

It can be observed that for all ; thus for all and . Assume that for all and then for all . It may be observed that

Similarly

Hence, for all and ; thus from the continuity of , holds for all , which completes the required result.

In the following the support of basic limit function of the proposed scheme has been calculated generated by the control point

Theorem 10. The basic limit function F defined by the scheme vanishes outside .

Proof. Define recursively by taking with . It can be observed that but . We claim that restriction of to vanishes outside . Since is symmetric, it is enough to prove that vanishes outside . Thus, after th subdivision step, the furthest nonzero vertex on the left/right will be at . So, it can be concluded that the left or right influence of the original nonzero vertex will propagate along . It can be concluded that is contained in for all and , which is the required result.

Theorem 11 11(see [15]). A convergent subdivision scheme that reproduces polynomial has an approximation order .

So in the light of the previous theorem, the proposed scheme has approximation order because the construction of mask is formulated through the cubic trigonometric polynomials.

The polynomial reproduction property has its own importance, as the reproduction property of the polynomials up to certain degree implies that the scheme has approximation order. For this, polynomial reproduction can be made from initial data which has been sampled from some polynomial functions. So, in view of the previous theorem, scheme (32) has approximation order 4.

6. Conclusion

A 4-point novel quaternary interpolating nonstationary subdivision scheme has been developed which generates the family of limiting curves and its limiting function has support on . The nonstationary scheme is associated with trigonometric polynomials which reproduces the functions of linear spaces spanned by for . The comparison shows that, with existing stationary and nonstationary interpolating schemes, the proposed scheme is better. Moreover, it also can reconstruct or reproduce the conic sections, asteroids, and cardioids.

References

C. Beccari, G. Casciola, and L. Romani, “A non-stationary uniform tension controlled interpolating 4-point scheme reproducing conics,” Computer Aided Geometric Design, vol. 24, no. 1, pp. 1–9, 2007.

M. K. Jena, P. Shunmugaraj, and P. C. Das, “A non-stationary subdivision scheme for curve interpolation,” ANZIAM Journal, vol. 44, pp. E216–E235, 2003.

C. Beccari, G. Casciola, and L. Romani, “An interpolating 4-point ternary non-stationary subdivision scheme with tension control,” Computer Aided Geometric Design, vol. 24, no. 4, pp. 210–219, 2007.

S. Daniel and P. Shunmugaraj, “Some interpolating non-stationary subdivision schemes,” in Proceedings of International Symposium on Computer Science and Society, pp. 400–403, 2011.

C. Conti and L. Romani, “Affine combination of B-spline subdivision masks and its non-stationary counterparts,” BIT Numerical Mathematics, vol. 50, no. 2, pp. 269–299, 2010.

S. S. Siddiqi and M. Younis, “Ternary three point non-stationary subdivision scheme,” esearch Journal of Applied Sciences, Engineering and Technology, vol. 4, no. 13, pp. 1875–1882, 2012.

S. S. Siddiqi and M. Younis, “Construction of m-point binary approximatin subdivision schemes,” Applied Mathematics Letters, vol. 26, no. 3, pp. 337–343, 2013.

N. Dyn, D. Levin, and J. A. Gregory, “A 4-point interpolatory subdivision scheme for curve design,” Computer Aided Geometric Design, vol. 4, no. 4, pp. 257–268, 1987.

M. F. Hassan, I. P. Ivrissimitzis, N. A. Dodgson, and M. A. Sabin, “An interpolating 4-point ternary stationary subdivision scheme,” Computer Aided Geometric Design, vol. 19, no. 1, pp. 1–18, 2002.

N. Dyn, “Tutorials on multresolution in geometric modelling,” in Summer Schools Lectures Notes Series: Mathematics and Visualization, A. Iske, E. Quak, and M. S. Floater, Eds., Springer, 1995.

N. Dyn and D. Levin, “Analysis of asymptotically equivalent binary subdivision schemes,” Journal of Mathematical Analysis and Applications, vol. 193, no. 2, pp. 594–621, 1995.

T. Lyche, “A newton form for trigonometric Hermite interpolation,” BIT Numerical Mathematics, vol. 19, no. 2, pp. 229–235, 1979.

N. Dyn and D. Levin, “Subdivision schemes in geometric modeling,” Acta Numerica, vol. 11, pp. 73–144, 2002.

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.

N. Dyn, “Subdivision schemes in computer aided geometric design,” in Advances in Numerical Analysis, Subdivision Algorithms and Radial Functions, W. A. Light, Ed., pp. 36–104, Oxford University Press, 1992.