A linear complexity algorithm for the Bernstein basis

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.

Saved in:
Bibliographic Details
Published in:2003 International Conference on Geometric Modeling and Graphics pp. 162 - 167
Main Authors: Delgado, J., Pena, J.M.
Format: Conference Proceeding
Language:English
Published: IEEE 2003
Subjects:
Algorithm design and analysis
Artificial intelligence
Character generation
Computational complexity
Computational efficiency
Graphics
Polynomials
Shape
Solid modeling
Stability
ISBN:0769519857, 9780769519852
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISBN:0769519857
9780769519852
DOI:10.1109/GMAG.2003.1219682