Content deleted Content added
→Outline of the algorithm: The upper limit of sumation in the first equation should have been n, not p-1. This is consistent with i=0 as the lower limit--the summation is over all control points before being optimized to just the support of x. |
Undid revision 493794871 by 68.41.222.176 (talk) p is the number of control points, not the degree of the curve as is commonly used. |
||
Line 14:
We can express the curve as
:<math> \mathbf{s}(x) = \sum_{i=0}^{
where<ref>http://www.cs.mtu.edu/~shene/COURSES/cs3621/NOTES/spline/B-spline/bspline-basis.html</ref>
<math>N_i^n(x)=\frac{x-u_i}{u_{i+n}-u_i}N_i^{n-1}(x) + \frac{u_{i+n+1}-x}{u_{i+n+1}-u_{i+1}}N_{i+1}^{n-1}(x) ,</math>
| |||