De Boor's algorithm: Difference between revisions

Revision as of 18:12, 27 July 2009

Revision as of 18:21, 21 August 2009

Line 1:

In the [[mathematics|mathematical]] subfield of [[numerical analysis]] the '''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 the [[de Casteljau's algorithm]] for [[Bezier 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. |year=1982|month=December |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>

== Introduction ==