Skip to main content

Co-convexity preserving Curve Interpolation

  • Chapter
Advanced Course on FAIRSHAPE

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Carnicer, J. M.: On best constrained interpolation. Numerical Algorithms 1 (1991), 155–176.

    Article  MathSciNet  MATH  Google Scholar 

  2. Carnicer, J. M.: Dual Bézier curves and convexity preserving interpolation. Computer Aided Geometric Design 9 (1992), 435–445.

    Article  MathSciNet  MATH  Google Scholar 

  3. Carnicer, J. M.: Rational interpolation with a single variable pole. Numerical Algorithms 3 (1992), 125–132.

    Article  MathSciNet  MATH  Google Scholar 

  4. 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.

    Article  MathSciNet  MATH  Google Scholar 

  5. Farin, G: Curves and Surfaces for Computer Aided Geometric Design. Academic Press, Boston, 1988.

    MATH  Google Scholar 

  6. Schaback, R: Interpolation with piecewise quadratic visually C 2 Bézier polynomials. Computer Aided Geometric Design 6 (1989), 219–233.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics