Algorithms for Computing Shape Preserving Spline Interpolations to Data
- 1 July 1977
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 31 (139) , 717-725
- https://doi.org/10.2307/2006003
Abstract
Algorithms are presented for computing a smooth piecewise polynomial interpolation which preserves the monotonicity and/or convexity of the data.Keywords
This publication has 13 references indexed in Scilit:
- Monotone and Convex Spline InterpolationSIAM Journal on Numerical Analysis, 1977
- Monotone quadratic spline interpolationJournal of Approximation Theory, 1977
- An improved estimate of the degree of monotone interpolationJournal of Approximation Theory, 1976
- The Degree of Piecewise Monotone InterpolationProceedings of the American Mathematical Society, 1975
- Piecewise monotone spline interpolationJournal of Approximation Theory, 1974
- Bernstein-Bézier Methods for the Computer-Aided Design of Free-Form Curves and SurfacesJournal of the ACM, 1974
- On interpolation and approximation by polynomials with monotone derivativesJournal of Approximation Theory, 1974
- Interactive Interpolation and Approximation by Bezier PolynomialsThe Computer Journal, 1972
- Polynomial Approximations to Finitely Oscillating FunctionsMathematics of Computation, 1961
- Bernstein Polynomials. By G.G. Lorentz Pp.x,130. 45s. 1954. Mathematical expositions, 8 (Toronto University Press; Geoffrey Cumberlege London)The Mathematical Gazette, 1955