Skip to main content
SpringerLink
Log in

Bernstein-Type Bases and Corner Cutting Algorithms for C 1 Merrien's Curves

  • Published:
Advances in Computational Mathematics Aims and scope Submit manuscript

Abstract

Bernstein bases, control polygons and corner-cutting algorithms are defined for C 1 Merrien's curves introduced in [7]. The convergence of these algorithms is proved for two specific families of curves. Results on monotone and convex interpolants which have been proved in [8] by Merrien and the author are also recovered.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R.E. Carlson and F.N. Fritsch, Monotone piecewise cubic interpolation, SIAM J. Numer. Anal. 17(3) (1980) 238–246.

    Google Scholar 

  2. J.M. Carnicer and J.M. Peña, Shape preserving representations and optimality of the Bernstein basis, Adv. Comput. Math. 1 (1993) 173–196.

    Google Scholar 

  3. J.M. Carnicer and J.M. Peña, Total positivity and optimal bases, in: Total Positivity and its Applications, eds. M. Gasca and C.A. Micchelli (Kluwer, Dordrecht, 1996) pp. 133–155.

    Google Scholar 

  4. A. Edelman and C.A. Micchelli, Admissible slopes for monotone and convex interpolation, Numer. Math. 51 (1987) 441–458.

    Google Scholar 

  5. M. Gasca and J.M. Peña, Corner-cutting algorithms and totally positive matrices, in: Curves and Surfaces in Geometric Design, eds. P.J. Laurent, A. Le Méhauté and L.L. Schumaker (A.K. Peters, Wellesley, 1994) pp. 177–184.

    Google Scholar 

  6. D.F. MacAllister and J.A. Roulier, Interpolation by convex quadratic splines, Math. Comp. 32 (1978) 1154–1162.

    Google Scholar 

  7. J.-L. Merrien, A family of Hermite interpolants by bisection algorithms, Numer. Algorithms 2 (1992) 187–200.

    Google Scholar 

  8. J.-L. Merrien and P. Sablonnière, Monotone and convex C 1 Hermite interpolants generated by a subdivision algorithm, Prépublication 01-17, Institut de Recherche Mathématique de Rennes (February 2001), Constr. Approx. (in press).

  9. C.A. Micchelli, Mathematical Methods in CAGD (SIAM, Philadelphia, PA, 1995).

    Google Scholar 

  10. L.L. Schumaker, On shape preserving quadratic spline interpolation, SIAM J. Numer. Anal. 20 (1983) 854–864.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INSA de Rennes, 20 avenue des Buttes de Coësmes, CS 14315, 35043, Rennes Cedex, France

    Paul Sablonnière

Authors
  1. Paul Sablonnière
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sablonnière, P. Bernstein-Type Bases and Corner Cutting Algorithms for C 1 Merrien's Curves. Advances in Computational Mathematics 20, 229–246 (2004). https://doi.org/10.1023/A:1025870005361

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1025870005361

Search

Navigation