Abstract
An algorithm is described for constructing C l co-convexity preserving interpolants to arbitrary sequences of points and possible tangents. The interpolants can be chosen to consist of cubic and parabolic pieces. The main tool is the numerical computation of C 2 convexity preserving interpolants to convex data arising from the minimization of certain functionals.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Carnicer, J. M.: On best constrained interpolation. Numerical Algorithms 1 (1991), 155–176.
Carnicer, J. M.: Dual Bézier curves and convexity preserving interpolation. Computer Aided Geometric Design 9 (1992), 435–445.
Carnicer, J. M.: Rational interpolation with a single variable pole. Numerical Algorithms 3 (1992), 125–132.
Carnicer, J. M., Dahmen, W.: Characterization of local strict convexity preserving interpolation methods by C 1 functions. Journal of Approximation Theory 77 (1994), 2–30.
Farin, G: Curves and Surfaces for Computer Aided Geometric Design. Academic Press, Boston, 1988.
Schaback, R: Interpolation with piecewise quadratic visually C 2 Bézier polynomials. Computer Aided Geometric Design 6 (1989), 219–233.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 B. G. Teubner Stuttgart
About this chapter
Cite this chapter
Carnicer, J.M., Floater, M.S. (1996). Co-convexity preserving Curve Interpolation. In: Hoschek, J., Kaklis, P.D. (eds) Advanced Course on FAIRSHAPE. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-82969-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-322-82969-6_2
Publisher Name: Vieweg+Teubner Verlag
Print ISBN: 978-3-519-02634-1
Online ISBN: 978-3-322-82969-6
eBook Packages: Springer Book Archive