De Boor's algorithm: Difference between revisions

Revision as of 10:35, 4 August 2017

Revision as of 11:33, 4 August 2017

Line 1:

{{Multiple Issues|

{{Cleanup|reason=The article does not differentiate between control points and knots. This leads to index errors in the formulas (usage of undefined knots <math>u_i</math>).}}

{{Cleanup|reason=The meaning of the degrees of freedom (control points) of the spline <math>d_i</math> is distorted in the introduction.}}

{{Missing|calculation of the degrees of freedom for interpolation and approximation.}}

}}

In the [[mathematics|mathematical]] subfield of [[numerical analysis]] '''de Boor's algorithm''' is a fast and [[numerically stable]] [[algorithm]] for evaluating [[spline curve]]s in [[B-spline]] form. It is a generalization of [[de Casteljau's algorithm]] for [[Bézier curve]]s. The algorithm was devised by [[Carl R. de Boor]]. Simplified, potentially faster variants of the de Boor algorithm have been created but they suffer from comparatively lower stability.<ref>{{cite journal |last=Lee |first=E. T. Y. |date=December 1982 |title=A Simplified B-Spline Computation Routine |journal=Computing |volume=29 |issue=4 |pages=365–371 |publisher=Springer-Verlag|doi=10.1007/BF02246763}}</ref><ref>{{cite journal | author = Lee, E. T. Y. | journal = Computing | issue = 3 | pages = 229–238 | publisher = Springer-Verlag | doi=10.1007/BF02240069|title = Comments on some B-spline algorithms | volume = 36 | year = 1986}}</ref>