Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Recursive polynomial curve schemes and computer-aided geometric design

  • Published:
Constructive Approximation Aims and scope

Abstract

A class of polynomial curve schemes is introduced that may have widespread application to CAGD (computer-aided geometric design), and which contains many well-known curve schemes, including Bézier curves, Lagrange polynomials, B-spline curve (segments), and Catmull-Rom spline (segments). The curves in this class can be characterized by a simple recursion formula. They are also shown to have many properties desirable for CAGD; in particular they are affine invariant, have the convex hull property, and possess a recursive evaluation algorithm. Further, these curves have shape parameters which may be used as a design tool for introducing such geometric effects as tautness, bias, or interpolation. The link between probability theory and this class of curves is also discussed.

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

Access this article

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

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. P. J. Barry (1987): Urn Models, Recursive Curve Schemes, and Computer-Aided Geometric Design. Ph.D. Dissertation, Department of Mathematics, University of Utah, Salt Lake City.

    Google Scholar 

  2. P. J.Barry, T. D.DeRose, R. N.Goldman (submitted):B-splines, Pólya curves, and duality.

  3. P. J. Barry, R. N. Goldman (1988):A recursive evaluation algorithm for a class of Catmull-Rom splines. Computer Graphics—SIGGRAPH '88 Conference Proceedings, vol. 22 pp. 199–204.

    Google Scholar 

  4. P. J.Barry, R. N.Goldman (submitted):Interpolation and approximation of curves and surfaces using Pólya polynomials.

  5. P. J. Barry, R. N. Goldman (1989):What is the natural generalization of a Bézier curve? In: Mathematical Methods in Computer Aided Geometric Design (T. Lyche, L. L. Schumaker, eds.). San Diego, CA: Academic Press, pp. 71–85.

    Google Scholar 

  6. P. J.Barry, R. N.Goldman (in preparation):Shape parameter deletion for Pólya curves.

  7. P. J.Barry, R. N.Goldman (submitted):A survey of urn models in computer-aided geometric design.

  8. R. H. Bartels, J. C. Beatty, B. A. Barsky (1987): An Introduction to Splines for Use in Computer Graphics and Geometric Modeling. Palo Alto, CA: Morgan Kaufmann.

    Google Scholar 

  9. W. Boehm (1980):Inserting new knots into B-spline curves. Comput. Aided Design,12:199–201.

    Google Scholar 

  10. W. Boehm, G. Farin, J. Kahmann (1984):A survey of curve and surface methods in CAGD. Comput. Aided Geom. Design,1:1–60.

    Google Scholar 

  11. C. de Boor (1972):On calculating with B-splines. J. of Approx. Theory,6:50–62.

    Google Scholar 

  12. C. de Boor (1978): A Practical Guide to Splines. New York: Springer-Verlag.

    Google Scholar 

  13. C. de Boor, G. Fix (1973):Spline approximated by quasi-interpolants. J. Approx. Theory,8:19–45.

    Article  Google Scholar 

  14. R. L. Burden, J. D. Faires, A. C. Reynolds (1978): Numerical Analysis. Boston: Prindle, Weber, and Schmidt.

    Google Scholar 

  15. E. Catmull, R. Rom (1974):A class of local interpolating splines. In: Computer Aided Geometric Design (R. E. Barnhill, R. F. Riesenfeld, eds.). New York: Academic Press, pp. 317–326.

    Google Scholar 

  16. E. Cohen, T. Lyche, R. Riesenfeld (1980):Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics. Comput. Graphics Image Process.,14:87–111.

    Article  Google Scholar 

  17. T. D.Derose, T. J.Holman (submitted):The triangle: a multiprocessor architecture for fast curve and surface generation.

  18. G. Farin (1988): Curves and Surfaces for Computer-Aided Geometric Design. San Diego, CA: Academic Press.

    Google Scholar 

  19. R. N. Goldman (1983):An urnful of blending functions. IEEE Comput. Graphics and Applications,3:49–54.

    Google Scholar 

  20. R. N. Goldman (1984):Markov chains and computer-aided geometric design: Part I—Problems and constraints. ACM Trans. Graphics,3:204–222.

    Google Scholar 

  21. R. N. Goldman (1985):Markov chains and computer-aided geometric design: Part II—Examples and subdivision matrices. ACM Trans. Graphics,4:12–40.

    Google Scholar 

  22. R. N. Goldman (1985):Pólya's urn model and computer-aided geometric design. SIAM J. Algebraic and Discrete Methods,6:1–28.

    Google Scholar 

  23. R. N. Goldman (1988):Urn models and B-splines. Const. Approx.,4:265–288.

    Google Scholar 

  24. A. C. Hearn (1984): REDUCE User's Manual. The Rand Corporation, Santa Monica, CA.

    Google Scholar 

  25. S. Karlin (1968): Total Positivity. Stanford, CA: Stanford University Press.

    Google Scholar 

  26. J. M. Lane, R. F. Riesenfeld (1980):A theoretical development for the computer generation and display of piecewise polynomial surfaces. IEEE Trans. Pattern Anal. Mach. Intell.,2:35–46.

    Google Scholar 

  27. A. H. Overhauser (1968): Analytic definition of curves and surfaces by parabolic blending. Scientific Research Staff Publication, Ford Motor Co., Detroit, MI.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by Klaus Höllig.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Barry, P.J., Goldman, R.N. Recursive polynomial curve schemes and computer-aided geometric design. Constr. Approx 6, 65–96 (1990). https://doi.org/10.1007/BF01891409

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01891409

Key words and phrases

AMS classification