The m-Point Quaternary Approximating Subdivision Schemes

In this article, the objective is to introduce an algorithm to produce the quaternary m-point (for any integer ) approximating subdivision schemes, which have smaller support and higher smoothness, comparing to binary and ternary schemes. The proposed algorithm has been derived from uniform B-spline basis function using the Cox-de Boor recursion formula. In order to determine the convergence and smoothness of the proposed schemes, the Laurent polynomial method has been used. 1 m 


Introduction
Until a few years ago all the work in the area of univariate subdivision was limited to consider just binary (Chaikin [1]; Dyn et al. [2,3]; Siddiqi and Younis [4]; Beccari et al. [5]) and ternary (Hassan and Dodgson [6]; Hassan et al. [7]; Ko et al. [8]; Mustafa et al. [9]) scenarios.In recent time, some proposals of quaternary subdivision schemes have introduced new interest in the era of subdivision, showing the possibility of treating refinement schemes with arity other than two or three.
Since subdivision schemes propose efficient iterative algorithms to produce the smooth curves and surfaces from a discrete set of control points by subdividing them according to some refining rules, recursively.These refining rules are very helpful and useful for the creation of smooth curves and surfaces in computational geometry and geometric designing due to their wide range of applications in many areas like engineering, medical science and image processing etc.
In this article an algorithm has been introduced to produce the quaternary point (for any integer ) approximating subdivision schemes.This algorithm has been developed using the Cox-de Boor recursion formula, in the form of uniform B-spline blending functions to produce piecewise polynomials of order over the interval (for detail, see Section 2).
The quaternary subdivision scheme can be defined in terms of a mask consisting of a finite set of non-zero coefficients
The formal definitions and the notion for the convergence analysis of the quaternary subdivision scheme are as follows: The quaternary convergent subdivision scheme with the corresponding mask necessarily satisfies 1.
It follows that the symbol of a convergent subdivision scheme satisfies the conditions In view of Dyn [3], the sufficient and necessary conditions for a uniform convergent scheme are defined as follows.
A subdivision scheme is uniform convergent if S and only if there is an integer , such that and satisfying the property where The norm S  of a subdivision scheme with a mask is defined by where The paper is organized as follows, in Section 2 the algorithm to construct -point (for any integer ) quaternary schemes has been introduced.Three examples are considered to produce the masks of 2-point (corner cutting), 3-point and 4-point schemes in the same section.In Section 3, the polynomial reproduction property has been discussed.The conclusion is drawn in Section 4.

Construction of the Algorithm
In this section, an algorithm has been constructed to produce the quaternary -point approximating subdivision schemes using the uniform B-spline basis functions and the Cox-de Boor recursion relation.The Cox-de Boor recursion relation, in view of Buss [10], can be defined as follows: m The recursion relation is the generalization to B-spline of degree (or of order , i.e., ).For this, consider to be a set of non-decreasing real numbers in such a way that 0 1 2 . The values i 's, not necessarily uniformly spaced, are called knots of non-uniform spline and the set is called knot vector.The uniform B-splines are just the special case of non-uniform B-splines in which the knots are equally spaced such that 1 depend only on the knot positions and are de-fined by induction on as follows. .
The form of above recursive formulas for the blending function immediately implies that the functions   , i n N t are piecewise polynomials of degree and that the breaks between pieces occur at the knots .
, together with the properties [10], can be defined in Equation (2).
The blending functions must satisfy the following properties:  The blending functions are translates of each other, that is, The masks , 0,1,2, , of the proposed quaternary -point scheme can be calculated using the following recurrence relation where is a uniform B-spline basis function of degree  .In the following, some examples are considered to produce the masks of 2-point, 3-point and 4-point quaternary approximating schemes after setting Copyright © 2013 SciRes.AJCM 2,3 m  and 4, respectively, in recurrence relation (3).The 2-point scheme: To obtain the mask of quarternary 2-point scheme, set in above relation (3).It may be noted that the linear uniform B-spline basis function produces the mask of 2-point quarternary scheme (which is also called corner cutting scheme).Thus 2-point scheme (after adjusting the mask) to refine the control polygon is defined as follows: Now, the convergence and smoothness of the proposed 2-point scheme can be analyzed using the Laurent polynomial method introduced by Tang et al. [11].
Theorem 2.1: The quaternary 2-point approximating subdivision scheme converges and has smoothness .
1 C Proof.To prove that the subdivision scheme corresponding to the symbol is .So, the Laurent polynomial for the mask of the scheme can be written as The Laurent polynomial method is used to prove the smoothness of the scheme to be .Taking With a choice of and , it can be written as S is contractive, by Theorem 3, and so S is convergent.
In order to prove the scheme developed to be , consider 1 C 2 m  and 1 L  ; it can be written as Since the norm of subdivision vergent and 1

S C
 .

The 3-point scheme:
To obtain the mask of quarternary univariate 3-point scheme, set in recursion relation (3).The quadratic uniform B-spline basis functions N t are obtained.The mask , 0,1,2 a i i  of the proposed quaternary 3-point scheme can be calculated from these basis functions.The 3-point scheme (after adjusting the mask), to refine the control polygon, is defined as: Theorem 2.2: The quaternary 3-point approximating subdivision scheme converges and has smoothness .Proof.The smoothness of the above subdivision scheme can be calculated following the same procedure.
The 4-point scheme: Now, a 4-point quaternary scheme is presented and masks of the scheme can be cal-culated from the cubic basis function.After setting in relation (3) the cubic B-spline basis functions can be calculated.Thus, 4-point scheme is defined as follows 2003 341 3072 3072 Theorem 2.3: The quaternary 4-point approximating subdivision scheme converges and has smoothness .
3 C Proof.The smoothness of the above subdivision scheme can be calculated following the same procedure.
In the following section the polynomial reproduction property has been discussed.

Properties
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 date which has been sampled from some polynomial function.In view of [12], the polynomial reproduction property of the proposed scheme can be obtained after having the parametrization

Definition 3.2: A quaternary subdivision scheme reproduces polynomial of degree if it is convergent and its continuous limit function (for any polynomial
) is equal to and initial data d The induction over can be performed to prove this theorem following [12].d In view of [12], the following proposition helps to find the necessary conditions defined in (9).Proposition 3.4: and hence generates polynomial of degree 1 d  , but it has only linear reproduction.
Proof.Following [12], for some Laurent polynomial and the fact    

Conclusion
A quaternary univariate point (for any integer ) approximating subdivision scheme has been developed which generates the smooth limiting curves.The construction of the quaternary scheme is associated with an algorithm of uniform B-spline basis functions developed from the Cox-de Boor recursion formula.The objective is to introduce the quaternary subdivision schemes, which have smaller support and higher smoothness, comparing to binary and ternary schemes.Moreover the polynomial reproduction property has also been discussed.
m 1 m 

Definition 3 . 1 :
and definitions in the following manner.For quaternary subdivision scheme the parametrization

3 . 3 :
A convergent quaternary subdivision scheme reproduces polynomials of degreewith respect to the parametrization defined in(8) if and only if d ni

5 :
Let a quaternary subdivision scheme that reproduces polynomial up to degree .Then the smoothed .Hence, it does not reproduce polynomials of degree . 1 d 