Efficient evaluation of multivariate polynomials
暂无分享,去创建一个
Abstract In CAGD applications, the usual way to store a polynomial defined over a triangle is in the Bernstein-Bezier form, and the accepted way to evaluate it at a given point in the triangle is by the de Casteljau algorithm. In this paper we present an algorithm for evaluating Berstein-Bezier type polynomials which is significantly faster than de Casteljau. This suggests that a modified form of Bernstein-Bezier may be preferable for CAGD applications (as well as in applications of piecewise polynomials in data fitting and numerical solution of boundary-value problems).
[1] L. L. Schumaker,et al. Numerical aspects of spaces of piecewise polynomials on triangulations , 1987 .
[2] Wolfgang Böhm,et al. A survey of curve and surface methods in CAGD , 1984, Comput. Aided Geom. Des..