Paper Info
Title
A Linear Complexity Algorithm For The Bernstein Basis
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.
Year
DOI
Venue
2003
10.1109/GMAG.2003.1219682
2003 INTERNATIONAL CONFERENCE ON GEOMETRIC MODELING AND GRAPHICS, PROCEEDINGS
Keywords
Field
DocType
linear time,solid modeling,computational complexity,artificial intelligence,stability,shape,graphics,time complexity,algorithm design and analysis,polynomials
Complexity class,Average-case complexity,Structural complexity theory,Algorithm,De Casteljau's algorithm,Bernstein polynomial,Simon's problem,Time complexity,Mathematics,Computational complexity theory
Conference
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
J. Delgado110717.39
Juan Manuel Peña213126.55