A construction of a bivariate C2 spline approximant with minimal degree on arbitrary triangulation

A. Serghini

Mathematics and Computers in Simulation (MATCOM), 2021, vol. 185, issue C, 358-371

Abstract: In this work, we use some results concerning the connection between blossoms and splines, especially those related to the smoothness conditions to develop an algorithm for constructing on an arbitrary triangulation a C2 spline approximant with minimal degree. Numerical tests are presented to illustrate the theoretical results.

Keywords: Blossoms; Splines; Bernstein basis; Smoothness (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475421000045
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:185:y:2021:i:c:p:358-371

DOI: 10.1016/j.matcom.2021.01.004

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().