Geometric Modeling and Graphics, International Conference on
Download PDF

Abstract

In this paper we obtain a new corner cutting algorithm for the evaluation of polynomials represented in the Bernstein-Bezier form. This algorithm has linear time complexity, in contrast to the quadratic time complexity of the usual de Casteljau algorithm.
Like what you’re reading?
Already a member?
Get this article FREE with a new membership!

Related Articles