We present a new algorithm for inserting knots into a B-spline curve. This algorithm combines the speed of Boehm's algorithm with the 'bounded depth' property of the Oslo algorithm-the property that the data flow graphs have depth dependent only on the degree of the curve, and not on the number of knots inserted.
- Boehm's knot insertion algorithm
- Goldman knot insertion algorithm
- Oslo algorithm
- polar form.