The aim of this paper is to construct a new non-uniform corner-cutting (NUCC) subdivision scheme that improves the accuracy of the classical (stationary and non-stationary) methods. The refinement rules are formulated via the reproducing property of exponential polynomials. An exponential polynomial has a shape parameter so that it may be adapted to the characteristic of the given data. In this study, we propose a method of selecting the shape parameter, so that it enables the associated scheme to achieve an improved approximation order (that is, three), in case that either the initial data or its derivative is bounded away from zero. In contrast, the classical methods attain the second-order accuracy. An analysis of convergence and smoothness of the proposed scheme is conducted. The proposed scheme is shown to have the same smoothness as the classical Chaikin's corner-cutting algorithm, that is, C1. Finally, some numerical examples are presented to demonstrate the advantages of the new corner-cutting algorithm.
Bibliographical noteFunding Information:
J. Yoon was supported in part by the National Research Foundation of Korea under grant NRF-2015R1A5A1009350 and NRF-2020R1A2C1A01005894 . B. Jeong is supported by NRF-2019R1A6A1A11051177 funded by the Ministry of Education, South Korea .
© 2021 Elsevier B.V.
- Approximation order
- Corner-cutting scheme
- Exponential B-spline
- Non-uniform subdivision