Construction of -point binary approximating subdivision schemes

In this paper, an algorithm to construct m -point (for any integer m > 1 ) binary approximating subdivision schemes has been developed using the Cox–de Boor recursion formula. Some properties like symmetry of basis functions and polynomial reproduction are also discussed. It can be observed that most of the existing binary approximating schemes (corner cutting scheme developed by Chaikin, and 3-point, 4-point, 5-point and 6-point schemes introduced by Siddiqi and Ahmad) are either special cases or can be reproduced by the proposed algorithm.