<b><i>C</i></b><sup>1</sup> Convexity-Preserving Interpolation of Scattered Data (Q4253086)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1307767
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | <b><i>C</i></b><sup>1</sup> Convexity-Preserving Interpolation of Scattered Data |
scientific article; zbMATH DE number 1307767 |
Statements
<b><i>C</i></b><sup>1</sup> Convexity-Preserving Interpolation of Scattered Data (English)
0 references
24 June 1999
0 references
convexity-preserving interpolation
0 references
data-dependent triangulation
0 references
scattered data fitting
0 references
smooth convex surface
0 references
numerical tests
0 references
0.9481888
0 references
0 references
0.9394208
0 references
0.9296222
0 references
0.9289966
0 references
0.92432463
0 references
0.92138815
0 references
The authors describe a method for convex interpolation of scattered data in the plane. More precisely, their method determines whether the given data values are convex and, if so, computes a convex \(C^1\) interpolant. The method consists in the construction of a data-dependent triangulation of the plane for which the piecewise linear interpolant is convex, the computation of a set of nodal gradients for which there exists a convex Hermite interpolant, and finally the construction of a smooth convex surface that interpolates the nodal values and gradients. A detailed numerical procedure and the results of some numerical tests are given.
0 references