![]() ��T= ![]() 其中, ![]() ![]() 于是, 根据定理1, 可以给出一条B样条曲线升阶的算法: ![]() for (i=k to k+s-1 by 1) Insert Knot ti into the curve; �j = -1; ��for (i=k-1 to n+s by mj+1) ��if (i == k-1) Start = 0; ��else Start = k - mj ; ��for (v=Start to k by 1) ��j = j + 1; �� ![]() ��for (u=0 to k-1 by 1) ![]() ![]() ![]() ��endfor endfor |