Bernstein-Bézier Methods for the Computer-Aided Design of Free-Form Curves and Surfaces

ABSTRACT

The mth degree Bernstein polynomial approximation to a function ƒ defined over [0, 1] is ∑m&mgr;=0 ƒ(&mgr;/m)&pgr;&mgr;(s), where the weights &pgr;&mgr;(s) are binomial density functions. The Bernstein approximations inherit many of the global characteristics of ƒ, like monotonicity and convexity, and they always are at least as “smooth” as ƒ, where “smooth” refers to the number of undulations, the total variation, and the differentiability class of ƒ. Historically, their relatively slow convergence in the L∞-norm has tended to discourage their use in practical applications. However, in a large class of problems the smoothness of an approximating function is of greater importance than closeness of fit. This is especially true in connection with problems of computer-aided geometric design of curves and surfaces where aesthetic criteria and the intrinsic properties of shape are major considerations. For this latter class of problems, P. Bézier of Renault has successfully exploited the properties of parametric Bernstein polynomials. The purpose of this paper is to analyze the Bézier techniques and to explore various extensions and generalizations. In a sequel, the authors consider the extension of the results contained herein to free-form curve and surface design using polynomial splines. These B-spline methods have several advantages over the techniques described in the present paper.

REFERENCES

• 1: B~ZIER, P., transl, by A. R. Forrest. Numerical Control. Wiley, New York, 1972.
• 2: B~ZIER, P. Proc~d~ de definition num~rique des courbes et surfaces non math~matique; Syst~me UNISURF. Automatisme 1~ (May 1968), 391-407.
• 3: B~zI~a, P. How Renault uses numerical control for car body design and tooling. Paper SAE 680010, Society of Automotive Engineers Congress, Detroit, Mich., 1968.
• 4: S. A. Coons, SURFACES FOR COMPUTER-AIDED DESIGN OF SPACE FORMS, Massachusetts Institute of Technology, Cambridge, MA, 1967
• 5: DAVIS, P.J. Interpolation and Approximation. Ginn-Blaisdell, New York, 1963.
• 6: FORREST, A.R. Interactive interpolation and approximation by B~!zier polynomials. Comput. J. 15 (1972), 71-79.
• 7: FORREST, A.R. Computational geometry. Proc. Royal Soc. London A8~1 (1971), 187-195.
• 8: FORREST, A.R. Coons' surfaces and multivariab)e functional interpolation. CAD Group Doc. 38, Computer Laboratory, Cambridge U., July 1970.
• 9: GORDON, W.j. "Blending-function" methods of bivariate and multivariate interpolation and ap'proximation. SIAM J. Numer. Anal. 8,1 (1971), 158-177.
• 10: GORDON, W. J. Distributive lattices and the approximation of multivariate functions. Proceedings of the Symposium on Approximation with Special Emphasis on Splines, I. J. Schoenberg, Ed., U. of Wisconsin, Academic Press, 1969, pp. 223-277.
• 11: GOI~DON, W.J. Free-form surface interpolation through curve networks. General Motors Research Publication GMR-921, General Motors Corp., Warren, Michigan, Oct. 1969.
• 12: :KELISKY, R. P., AND R~VL{N, T.J. Iterates of Bernstein polynomials. Pacific J. Math. 21, 3 (1967), 511-520.
• 13: K~.MENY, JOHN G., AND SNELL, J. LAURIE. Finite Markov Chains. Van Nostrand, Princeton, N.J., 1960.
• 14: LORENTZ, G.G. Bernstein Polynomials. U. of Toronto Press, Toronto, 1953.
• 15: Poeowclu, T. Sur l'approximation des fonctions convex d'ordre sup~rieur. Mathematica 10 (1935), 49-54.
• 16: SCnO~NB~Q, I. J. On variation diminishing approximation methods. In On Numerical Approximation, R. E. Langer, Ed., U of Wisconsin Press, 1959, pp. 249-274.
• 17: SCHO~NB~.R~, I. J. Smoothing operators and their generating functions. Bull. Amer. Math. Soc. 59 (1953), 199-230.

INDEX TERMS

Primary Classification:
  J. Computer Applications

Additional Classification:
  I. Computing Methodologies
  I.3 COMPUTER GRAPHICS
      I.3.5 Computational Geometry and Object Modeling
          Subjects: Curve, surface, solid, and object representations

General Terms:
Design, Measurement, Performance, Theory