Another knot insertion algorithm for B-spline curves

From MaRDI portal





A new algorithm for inserting knots into a \(B\)-spline curve is discussed. This algorithm has the efficiency of Boehm's knot insertion algorithm [cf. \textit{W. Boehm}, Inserting new knots into \(B\)-spline curve, Computer- Aided Design 12, 199-202 (1980)] and the depth property of the Oslo algorithm [cf. \textit{E. Cohen, T. Lyche}, and \textit{R. F. Riesenfeld}, Discrete \(B\)-splines and subdivision techniques in computer-aided geometric design and computer graphics, Computer Graphics and Image Processing 14, 87-111 (1980)].











This page was built for publication: Another knot insertion algorithm for B-spline curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1195077)