Knot Insertion and Deletion Algorithms for B-Spline Curves and Surfaces

Knot insertion and deletion algorithms are the two fundamental procedures used to understand, analyze, and render B-spline curves and surfaces. Papers cover blossoming, algorithms for progressive curves, factored knot insertion, knot insertion algorithms, conversion between B-spline bases using the generalized Oslo algorithm, how much the size of the B-spline coefficients can be reduced by inserting one knot, and the envelope approach to a sketching editor for hierarchical free-form curve design and modification. Annotation copyright Book News, Inc. Portland, Or.