An algorithm for convexity-preserving surface interpolation
From MaRDI portal
Publication:1891300
DOI10.1007/BF01578387zbMath0823.65012OpenAlexW2028423723MaRDI QIDQ1891300
Publication date: 30 May 1995
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01578387
performancesurfacemonotonicitynumerical resultsconvexityconvexity-preserving surface interpolationRoulier method
Numerical interpolation (65D05) Multidimensional problems (41A63) Interpolation in approximation theory (41A05) Approximation with constraints (41A29) Algorithms for approximation of functions (65D15)
Related Items
A numerically efficient dissipation-preserving implicit method for a nonlinear multidimensional fractional wave equation, A finite-difference discretization preserving the structure of solutions of a diffusive model of type-1 human immunodeficiency virus, A bounded and efficient scheme for multidimensional problems with anomalous convection and diffusion
Uses Software
Cites Work
- An algorithm for computing shape-preserving interpolating splines of arbitrary degree
- A one-pass algorithm for shape-preserving quadratic spline interpolation
- Shape-Preserving Bivariate Interpolation
- On Shape Preserving Quadratic Spline Interpolation
- Monotone Piecewise Bicubic Interpolation
- A Method for Constructing Local Monotone Piecewise Cubic Interpolants
- Monotonicity Preserving Surface Interpolation
- Co-Monotone Interpolating Splines of Arbitrary Degree—a Local Approach
- An Algorithm for Monotone Piecewise Bicubic Interpolation
- Monotone Piecewise Cubic Interpolation
- An Algorithm for Computing a Shape-Preserving Osculatory Quadratic Spline
- Accurate $C^2$ Rational Interpolants in Tension
- On Monotone and Convex Spline Interpolation