On efficient algorithms for polynomial evaluation in CAGD

• Autores: Jorge Delgado Gracia , Juan Manuel Peña Ferrández
• Localización: VIII Journées Zaragoza-Pau de Mathématiques Appliquées et de Statistiques / coord. por Manuel Pedro Palacios Latasa , David Trujillo, Juan José Torrens Iñigo , Monique Madaune-Tort , María Cruz López de Silanes Busto , Gerardo Sanz Sáiz , 2003, ISBN 84-7733-720-9, págs. 111-120
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • 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.