DocumentCode
1843616
Title
A linear complexity algorithm for the Bernstein basis
Author
Delgado, Joaquim ; Pena, Jose M.
Author_Institution
Departamento de Matematica Aplicada, Univ. de Zaragoza, Spain
fYear
2003
fDate
16-18 July 2003
Firstpage
162
Lastpage
167
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.
Keywords
computational complexity; polynomials; Bernstein basis; Bernstein representation; Bernstein-Bezier form polynomial; Casteljau algorithm; corner cutting algorithm; linear complexity algorithm; linear time complexity; polynomial evaluation; quadratic time complexity; Algorithm design and analysis; Artificial intelligence; Character generation; Computational complexity; Computational efficiency; Graphics; Polynomials; Shape; Solid modeling; Stability;
fLanguage
English
Publisher
ieee
Conference_Titel
Geometric Modeling and Graphics, 2003. Proceedings. 2003 International Conference on
Print_ISBN
0-7695-1985-7
Type
conf
DOI
10.1109/GMAG.2003.1219682
Filename
1219682
Link To Document