The B-spline basis function is given by one recursive formula. HoweverI hope to obtain popular expression: a0x^n + a1x^(n-1) + ... + an.From the answer How to build a recursive spline function in C++, it seems that Piegl's algorithm can do that. Can anyone give more information about the algorithm?
Piegl's algorithm in calculating B-spline basis function
b spline