Abstract
Linear conditions for a C 0 spline to be convex are developed and used to create some convexity preserving interpolation and approximation methods.
Similar content being viewed by others
References
Carnicer, J.M., Floater, M.S.: Piecewise linear interpolants to Lagrange and Hermite convex scattered data. Numer. Algoritm. 13, 345–364 (1996)
Grandine, T.A.: On convexity of piecewise polynomial functions on triangulations. Comput. Aided Geom. Des. 6, 181–187 (1989)
Lai, M.J., Schumaker, L.L.: Spline Functions on Triangulations. Cambridge University Press, Cambridge (2007)
Scott, D.S.: The complexity of interpolating given data in three space with a convex function of two variables. J. Approx. Theory 42, 52–63 (1984)
Schumaker, L.L., Speleers, H.: Convexity preserving splines over triangulations. Comput. Aided Geom. Des. 28, 270–284 (2011)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by: Arieh Iserles
Rights and permissions
About this article
Cite this article
Schumaker, L.L., Speleers, H. Convexity preserving C 0 splines. Adv Comput Math 40, 117–135 (2014). https://doi.org/10.1007/s10444-013-9301-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10444-013-9301-8