A non-uniform corner-cutting subdivision scheme with an improved accuracy

DOI10.1016/J.CAM.2021.113446MaRDI QIDQ2656098zbMATH OpenOpenAlexFDO

Authors Byeongseon Jeong, Hyoseon Yang, Jungho Yoon

Publication date 10 March 2021

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2011.06460

approximation order corner-cutting scheme exponential B-spline non-uniform subdivision

Spline approximation (41A15) Multidimensional problems (41A63) Algorithms for approximation of functions (65D15) Computer-aided design (modeling of curves and surfaces) (65D17)

Abstract: 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 nonstationary) 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, {em three}), while 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,

C^{1}

. Finally, some numerical examples are presented to demonstrate the advantages of the new corner-cutting algorithm.

Review text

Corner cutting and subdivision algorithms are methods for computing (spline- or otherwise) approximations of surfaces in efficient and stable recursive schemes. The coefficients of these recursive algorithms are called masks. They can result in piecewise polynomial surfaces or for instance piecewise exponentials. The schemes can be formed with equally spaced or non-meshed data points (knots). In this article the non-stationary case for piecewise exponentials is considered. The particular focus is not only on the efficiency of the algorithm but on its asymptotic accurracy, achieved by reproducing exponential functions, and especially the improvement of the convergence order from the results of the classical schemes. The essential parts of the work contain (i) a suitable choice of the so-called subdivision mask, i.e., the coefficients, (ii) using the correct parameters for the exponentials (i.e., their coefficients in the exponent), and (iii) deriving convergence results from this. For (ii), the reproduction of the exponentials that can later-on be used in the asymptotic convergece estimates is particularly important, but the authors noted that only local reproduction of exponentials is needed because the convergence results are local too. For (iii), Theorem~5.6 is the most relevant result. The authors give several numerical examples at the end of the article as well.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: A non-uniform corner-cutting subdivision scheme with an improved accuracy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656098)