De Boor's algorithm: Difference between revisions

Revision as of 08:15, 1 July 2009

Revision as of 14:20, 27 July 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]]. A simplified and potentially faster variant of the algorithm was created by E. T. Y. Lee.<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>

== Introduction ==

Line 42 ⟶ 43:

*[http://www.cs.mtu.edu/~shene/COURSES/cs3621/NOTES/spline/de-Boor.html De Boor's Algorithm]

*[http://www.css.taylor.edu/~btoll/s99/424/res/ucdavis/CAGDNotes/Deboor-Cox-Calculation/Deboor-Cox-Calculation.html The DeBoor-Cox Calculation]

== References ==

<references/>

[[Category:Geometric algorithms]]