| Abstract: | Corner cutting algorithms are used in different fields and, in particular, play a relevant role in Computer Aided Geometric
Design. Evaluation algorithms such as the de Casteljau algorithm for polynomials and the de Boor–Cox algorithm for B‐splines
are examples of corner cutting algorithms. Here backward and forward error analysis of corner cutting algorithms are performed.
The running error is also analyzed and as a consequence the general algorithm is modified to include the computation of an
error bound.
This revised version was published online in June 2006 with corrections to the Cover Date. |
