The complexity of interpolating given data in three space with a convex function of two variables
From MaRDI portal
Publication:1061327
DOI10.1016/0021-9045(84)90055-8zbMath0569.41004OpenAlexW1971887322MaRDI QIDQ1061327
Publication date: 1984
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(84)90055-8
Multidimensional problems (41A63) Interpolation in approximation theory (41A05) Algorithms for approximation of functions (65D15)
Related Items
Curve interpolation with constrained length ⋮ Convexity preserving \(C^0\) splines ⋮ Piecewise linear interpolants to Lagrange and Hermite convex scattered data ⋮ Convexity preserving interpolation and Powell-Sabin elements ⋮ Convexity preserving interpolation ⋮ Adaptive thinning for bivariate scattered data
Cites Work
This page was built for publication: The complexity of interpolating given data in three space with a convex function of two variables
