Error analysis of corner cutting algorithms

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

Full description

Saved in:
Bibliographic Details
Published inNumerical algorithms Vol. 22; no. 1; pp. 41 - 52
Main Authors Mainar, E., Peña, J.M.
Format Journal Article
LanguageEnglish
Published New York Springer Nature B.V 01.10.1999
Subjects
Algorithms
CAD
Computer aided design
Cutting
Error analysis
Polynomials
Spline functions
Online AccessGet full text
ISSN1017-1398
1572-9265
DOI10.1023/A:1019190220312

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1017-1398
1572-9265
DOI:10.1023/A:1019190220312