loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2003 International Conference on Geometric Modeling and Graphics (GMAG'03)
A Linear Complexity Algorithm for the Bernstein Basis
London, England
July 16-July 18
ISBN: 0-7695-1985-7
ASCII Text
x 
 
J. Delgado, J.M. Peña, "A Linear Complexity Algorithm for the Bernstein Basis," Geometric Modeling and Graphics, International Conference on, pp. 162, 2003 International Conference on Geometric Modeling and Graphics (GMAG'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/GMAG.2003.1219682,
author = {J. Delgado and J.M. Peña},
title = {A Linear Complexity Algorithm for the Bernstein Basis},
journal ={Geometric Modeling and Graphics, International Conference on},
volume = {0},
year = {2003},
isbn = {0-7695-1985-7},
pages = {162},
doi = {http://doi.ieeecomputersociety.org/10.1109/GMAG.2003.1219682},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Geometric Modeling and Graphics, International Conference on
TI - A Linear Complexity Algorithm for the Bernstein Basis
SN - 0-7695-1985-7
SP
EP
A1 - J. Delgado,
A1 - J.M. Peña,
PY - 2003
KW - null
VL - 0
JA - Geometric Modeling and Graphics, International Conference on
ER -
 
J. Delgado, Universidad de Zaragoza
J.M. Peña, Universidad de Zaragoza
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.
Citation:
J. Delgado, J.M. Peña, "A Linear Complexity Algorithm for the Bernstein Basis," gmag, pp.162, 2003 International Conference on Geometric Modeling and Graphics (GMAG'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.