Access Restriction

Author Gordon, William J. ♦ Riesenfeld, Richard F.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1974
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract The $\textit{m}th$ degree Bernstein polynomial approximation to a function ƒ defined over [0, 1] is $∑\textit{m}\textit{μ}=0$ $ƒ(\textit{μ}/\textit{m})\textit{πμ}(\textit{s}),$ where the weights $\textit{πμ}(\textit{s})$ are binomial density functions. The Bernstein approximations inherit many of the $\textit{global}$ characteristics of ƒ, like monotonicity and convexity, and they always are at least as $\textit{“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 $\textit{splines}.$ These B-spline methods have several advantages over the techniques described in the present paper.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1974-04-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 21
Issue Number 2
Page Count 18
Starting Page 293
Ending Page 310

Open content in new tab

   Open content in new tab
Source: ACM Digital Library