I have been trying to figure out how the following function work in TKMath, in the package for BSplines:
void BSplCLib::Bohm(const Standard_Real U,
const Standard_Integer Degree,
const Standard_Integer N,
const Standard_Integer Dimension,
According to the manual, it uses Böhm's algorithm to compute the value and derivatives up to order N. When I search for this algorithm, I find references to knot insertion. Are the two somehow connected? Is there some kind of a guide that explains what is happening in this algorithm?
I found the paper of W. Böhm from 1983 about "Efficient evaluation of B-Splines", but have so far been unable to identify the similarities...
Thank you for you help!