De Boor's algorithm: Difference between revisions

Content deleted Content added
A real implementation needs to find u such that [uk, uk+1). This takes O(number knots) in worst case.
No edit summary
Line 44:
*[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]
 
=== Computer code ===
[https://github.com/retuxx/tinyspline TinySpline: Open source C-library for splines which implements De Boor's algorithm]
 
== References ==