American Journal of Computational Mathematics
Volume 3, Issue 1 (April 2013)
ISSN Print: 2161-1203 ISSN Online: 2161-1211
Google-based Impact Factor: 0.42 Citations
The m-Point Quaternary Approximating Subdivision Schemes ()
Affiliation(s)
ABSTRACT
In this article, the objective is to introduce an algorithm to produce the quaternary m-point (for any integer m>1) 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.
KEYWORDS
Share and Cite:
Cited by
Copyright © 2024 by authors and Scientific Research Publishing Inc.
This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.