- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- 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
ISRN Applied Mathematics
Volume 2012 (2012), Article ID 197383, 14 pages
A Family of Even-Point Ternary Approximating Schemes
Department of Mathematics, The Islamia University of Bahawalpur, Bahawalpur 63100, Pakistan
Received 27 July 2012; Accepted 8 September 2012
Academic Editors: L. Ju, F. Lamnabhi-Lagarrigue, G. Psihoyios, H. C. So, and X. Yang
Copyright © 2012 Abdul Ghaffar and Ghulam Mustafa. 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.
We presented a general formula to generate the family of even-point ternary approximating subdivision schemes with a shape parameter for describing curves. Some sufficient conditions for to continuity and approximation order for certain ranges of parameter are discussed. The proposed even-point ternary schemes compare remarkably with existing even-point ternary schemes because they are able to generate limit functions with higher smoothness and approximation order. In addition, we measured curvature and torsion that assist the quality of subdivided curves.
1. Introduction and Preliminaries
There are numbers of binary subdivision schemes in the literature. The interest in investigating arities higher than two has been started by Hassan et al. [1, 2]. Nowadays, we have numbers of ternary schemes introduced by [3–7] and so forth, But the research communities are still gaining interest in introducing schemes higher than three arities (i.e., quaternary, quinary, senary,, -ary). Mustafa and Khan  introduced a new 4-point quaternary approximating subdivision scheme. Lian [9, 10] introduced 3-, 4-, 5-, and 6-point -ary schemes. Lian  also offered -point and -point interpolating -ary schemes for curve design.
The 2-, 3-,…, 6-point binary and ternary schemes are very common in the literature. The schemes involving convex combination of more or less than six points at coarse refinement level to insert a new point at next refinement level is introduced by Ko et al. . They introduced - and -point binary schemes. Zheng et al.  investigated ternary interpolatory schemes with an odd number of control points, namely, -point ternary interpolatory subdivision scheme. They also investigated ternary even symmetric -point  and -ary  approximating subdivision scheme and presented the general ternary even symmetric -point approximating subdivision rule and design alternative smooth ternary subdivision scheme of higher order. Mustafa and Rehman  presented general formulae for the mask of -point -ary approximating as well as interpolating subdivision schemes for any integers and .
This motivates us to present the family of even-point ternary schemes with high smoothness and more degree of freedom for curve design. Proposed schemes not only provide the mask of even-point schemes but also generalize and unify several well-known schemes. Moreover, we measured curvature and torsion that can be used to describe the quality of curve. Also we compared plot of curvature and torsion, obtained by proposed schemes with the other existing schemes.
A general compact form of univariate ternary subdivision scheme , which maps polygon to a refined polygon is defined by where the set of coefficients is called the mask at -th level of refinement. A necessary condition for the uniform convergence of subdivision scheme (1.1) is that A subdivision scheme is uniformly convergent if for any initial data , there exists a continuous function such that for any closed interval Obviously, , introducing a symbol called Laurent polynomial of the mask which plays an efficient role to analyze the convergence and smoothness of subdivision scheme. From (1.2) and (1.4) the Laurent polynomial of convergent subdivision scheme satisfies This condition guarantees existence of a related subdivision scheme for the divided difference of the original control points and the existence of associated Laurent polynomial The subdivision scheme with Laurent polynomial is related to scheme with Laurent polynomial by the following theorem.
Theorem 1.1 (see ). Let denote a subdivision scheme with Laurent polynomial satisfying (1.5). Then there exists a subdivision scheme with the property where and . Furthermore, is a uniformly convergent if and only if converges uniformly to zero function for all initial data , in the sense that
A scheme satisfying (1.8) for all initial data is termed “contractive.” The above theorem indicates that for any given scheme , with mask “” satisfying (1.2), we can prove the uniform convergence of by deriving the mask of and computing for , where is the first integer for which . If such an exists, then converges uniformly. Since there are three rules for computing the values at next refinement level, so we define the norm as follows: where
The paper is organized as follows: the family of even-point ternary approximating scheme and analysis of two even-point ternary schemes are presented in Section 2. Basic properties of even-point ternary schemes are discussed in Section 3. Comparison with existing even-point ternary schemes is shown in Section 4. A few remarks and future work constitute Section 5.
2. The Even-Point Ternary Approximating Schemes
Here we offer a general formula for even-point ternary approximating subdivision schemes with one parameter in the form of Laurent polynomial where is shape parameter, and depends on .
Despite the fact that we can generate -point ternary approximating schemes from (2.1) for any , , however for straightforwardness, we generated and discussed the smoothness of 4- and 6-point ternary schemes. The general proof regarding the support of even-point ternary schemes has been presented in this paper.
2.1. Point Ternary Scheme
From (2.1) for , we get the following: Laurent polynomial for a 4-point ternary scheme From the above polynomial, we suggest the following 4-point ternary approximating scheme: From (1.12) and (2.2), we have If is the scheme corresponding to , then for continuity, we require that satisfies (1.2), which it does and , for .
Since by (1.10), for , , and , we have In order to obtain a scheme, we substitute in , we have Using (1.12), we get If is the scheme corresponding to , then for continuity, we require that satisfy (1.2), which it does and , for .
For and , we have Therefore is contractive, that is, and the scheme is .
2.2. 6-Point Ternary Scheme
From (2.1) for , we get the following 6-point ternary approximating scheme: The continuity of this scheme can be computed in a similar way as we did for the 4-point ternary scheme.
From above discussion, we reach the conclusion shown in Table 1.
Remark 2.1. (i)For , , it becomes 4-point ternary subdivision scheme . (ii)If we set , , it becomes 4-point ternary subdivision scheme . (iii)In case , , we get mask of 6-point ternary subdivision scheme .
3. Basic Properties of the Schemes
In this section, we discuss approximation order and support of basic limit function of even-point ternary approximating schemes.
3.1. Approximation Order
Here we only find the approximation order of proposed 4-point ternary scheme. The approximation order of other even-point ternary schemes can be computed in a similar fashion.
Theorem 3.1. A 4-point ternary approximating scheme has approximating order 4 for and 5 for .
A 6-point ternary approximating scheme has approximating order 7 for and 8 for .
Proof. We carry out this result by taking our origin the middle of an original span with ordinate .
If , then we have where, , , , , .
If , then where represents the differences of the vertices.
If , then Taking further differences, we get .
If , then This implies that .
If , then By taking further differences, we have Since by , 4-point ternary scheme has cubic precision for and quartic at then 4-point ternary scheme has approximating order 4 for and 5 for . The proof of other part is similar.
3.2. Support of Basic Limit Function
The basic limit functions, of proposed ()-point ternary approximating schemes, for , are presented in Figures 1(a) and 1(b). The following theorem is related to the support of basic limit functions of even point ternary schemes.
Theorem 3.2. The basic limit functions of proposed -point ternary approximating schemes have support width , where , , which implies that it vanishes outside the interval .
Proof. The support width “” of the basic limit functions can be determined by computing how for the effect of the nonzero vertex will propagate along by. As the mask of scheme is -long sequence by centering it on that vertex, the distances to the last of its left and right nonzero coefficients are equal to and , respectively. At the first subdivision step we see that the vertices on the left and right sides of at and are the furthest nonzero new vertices. At each refinement, the distances on both sides are reduced by the factor . At the next step of the scheme this will propagate along by on the left and on the right. Hence after subdivision steps the furthest nonzero vertex on the left will be at and on the right will be at . So the total support width is .
4. Comparison and Application
In order to show the performance of the proposed schemes, we compare continuity, support, approximation order, and shape of limit curves. We also discuss curvature and torsion.
Comparison of various 4- and 6-point ternary schemes are given in Tables 2 and 3. Figure 2 shows visual comparison of 4- and 6-point ternary interpolating and approximating schemes with the proposed ternary approximating schemes.
4.1. Curvature and Torsion
The quality of subdivided curves can be assessed quantitatively by measuring curvature and torsion, as functions of cumulative chord length. Curvature is the amount by which a geometric object deviates from being flat, or straight in the case of a line, while in the elementary geometry of space curves, torsion measures the rate at which a twisted curve tends to depart from its osculating plane. When the torsion is zero, osculating plane never changes, and we have a plane curve. We used the method described in  to determine the curvature and torsion. The appearance of curvature and torsion obtained by our schemes is measured and compared with the plot or appearance generated by other schemes. The examples in Figure 3 show the results of curvature and torsion, together with their control polygon. The appearance of curvature of the schemes [2, 3, 5, 9] is quite similar and plot of curvature of the schemes [4, 7, 14] is different. Figure 4 shows detailed view of space curve, curvature and torsion generated by existing schemes [2–5, 7, 9] and proposed schemes. Overall one can observe that the plot of space curve, curvature, and torsion of proposed schemes are more smoothing than other existing schemes.
The family of even-point approximating schemes for curve design has been established. The 4- and 6-point ternary schemes introduced by Zheng et al. [13, 14] are special cases of our proposed even-point approximating schemes. Smoothness and approximation order of proposed 4- and 6-point ternary schemes have been discussed. Support of family of even-point ternary schemes has been computed in general. It has been shown that proposed schemes are much better than existing ternary schemes in the sense of smoothness, approximation order, curvature, and torsion. The family of odd-point ternary approximating schemes will be studied in detail in the forthcoming paper.
This work is supported by the Indigenous Ph.D Scholarship Scheme of Higher Education Commission (HEC) Pakistan.
- M. F. Hassan and N. A. Dodgson, “Ternary and three-point univariate subdivision schemes,” in Curve and Surface Fitting: Saint-Malo, 2002, A. Cohen, J. L. Marrien, and L. L. Schumaker, Eds., pp. 199–208, Nashboro Press, Brentwood, Calif, USA, 2003.
- 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.
- 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.
- C. Beccari, G. Casciola, and L. Romani, “Shape controlled interpolatory ternary subdivision,” Applied Mathematics and Computation, vol. 215, no. 3, pp. 916–927, 2009.
- G. Deslauriers and S. Dubuc, “Symmetric iterative interpolation processes,” Constructive Approximation, vol. 5, no. 1, pp. 49–68, 1989.
- F. Khan and G. Mustafa, “Ternary six-point interpolating subdivision scheme,” Lobachevskii Journal of Mathematics, vol. 29, no. 3, pp. 153–163, 2008.
- K. P. Ko, B.-G. Lee, and G. J. Yoon, “A ternary 4-point approximating subdivision scheme,” Applied Mathematics and Computation, vol. 190, no. 2, pp. 1563–1573, 2007.
- G. Mustafa and F. Khan, “A new 4-point quaternary approximating subdivision scheme,” Abstract and Applied Analysis, vol. 2009, Article ID 301967, 14 pages, 2009.
- J.-A. Lian, “On a-ary subdivision for curve design. I. 4-point and 6-point interpolatory schemes,” Applications and Applied Mathematics, vol. 3, no. 1, pp. 18–29, 2008.
- J.-A. Lian, “On a subdivision for curve design. II. 3-point and 5-point interpolatory schemes,” Applications and Applied Mathematics, vol. 3, no. 2, pp. 176–187, 2008.
- J.-a. Lian, “On a-ary subdivision for curve design. III. 2m-point and -point interpolatory schemes,” Applications and Applied Mathematics, vol. 4, no. 2, pp. 434–444, 2009.
- H. Zheng, M. Hu, and G. Peng, “Constructing 2n-1-point ternary interpolatory subdivision schemes by using variation of constants,” in Proceedings of the International Conference on Computational Intelligence and Software Engineering (CISE '09).
- H. Zheng, M. Hu, and G. Peng, “Ternary even symmetric 2n-point subdivision,” in Proceedings of the International Conference on Computational Intelligence and Software Engineering (CISE '09).
- H. Zheng, M. Hu, and G. Peng, “P-ary subdivision seneralizing B-splines,” in Proceedings of the 2nd International Conference on Computer and Electrical Engineering (ICCEE '09), 2009.
- G. Mustafa and N. A. Rehman, “The mask of -point n-ary subdivision scheme,” Computing. Archives for Scientific Computing, vol. 90, no. 1-2, pp. 1–14, 2010.
- M. A. Sabin and N. A. Dodgson, “A circle-preserving variant of the four-point subdivision scheme,” in Mathematical Methods for Curve and Surfaces. Troms 2004, M. Dhlen, K. Mrken, Schumaker, and L, Eds., Modern Methods in Mathematics, pp. 275–286, Nashboro Press, Brentwood, Calif, USA, 2005.