Convex preserving scattered data interpolation using bivariate \(C^1\) cubic splines (Q1576461): Difference between revisions
From MaRDI portal
Latest revision as of 10:52, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convex preserving scattered data interpolation using bivariate \(C^1\) cubic splines |
scientific article |
Statements
Convex preserving scattered data interpolation using bivariate \(C^1\) cubic splines (English)
0 references
1 August 2001
0 references
The author uses a bivariate \(C^1\) cubic spline space over a triangulated quadrangulation to the convexity preserving surface design problem. This interpolation problem expressed in terms of Bernstein-Bézier polynomials is presented as a quadratically constraint quadratic programming problem. Then the author derives three linearly constraint quadratic programming problems to solve the interpolatory convexity preserving problem. He shows the existence of convexity preserving interpolatory surface under certain conditions on the data.
0 references
interpolation
0 references
bivariate splines
0 references
scattered data interpolation
0 references
Bernstein-Bézier polynomials
0 references
convexity preserving surface design
0 references
quadratic programming
0 references
0 references
