Resumen de On efficient algorithms for polynomial evaluation in CAGD

Jorge Delgado Gracia , Juan Manuel Peña Fernández

• For evaluating polynomial curves in computer design the usual algorithm is the de Casteljau algorithm. Although it is simple and stable, this algorithm is not efficient, in the sense that it has not linear complexity. In this paper we discuss and compare the properties of four more efficient algorithms used under some circumstances as alternative to the de Casteljau algorithm.