Approximation by cubicC1-splines on arbitrary triangulations
β Scribed by R. H. J. Gmelig Meyling
- Publisher
- Springer-Verlag
- Year
- 1987
- Tongue
- English
- Weight
- 974 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0029-599X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We develop a local Lagrange interpolation scheme for quartic C 1 splines on triangulations. Given an arbitrary triangulation , we decompose into pairs of neighboring triangles and add "diagonals" to some of these pairs. Only in exceptional cases, a few triangles are split. Based on this simple refin
The structure of bivariate spline space over arbitrary triangulation is complicated because the dimension of a multivariate spline space depends not only on the topological property of the triangulation but also on its geometric property. A new vertex coding method to a triangulation is introduced i
In a recent paper by Hu it is proved that for any convex function f there is a C 1 convex quadratic spline s with n knots that approximates f at the rate of | 3 ( f, n &1 ). The knots of the spline are basically equally spaced. In this paper we give a simple construction of such a spline with equall