B-spline Curves: Knot Insertion

The meaning of knot insertion is adding a new knot into the existing knot vector without changing the shape of the curve. This new knot may be equal to an existing knot and, in this case, the multiplicity of that knot is increased by one. Because of the fundamental equality m = n + p + 1, after adding a new knot, the value of m is increased by one and, consequently, either the number of control points or the degree of the curve must also be increased by one. Changing the degree of the curve due to the increase of knots will change the shape of the curve globally and will not be considered. Therefore, inserting a new knot causes a new control point to be added. In fact, some existing control points are removed and replaced with new ones by corner cutting.

Although knot insertion looks like not very interesting, it is one of the most important algorithms for B-spline curves since many other useful algorithms are based on knot insertion. Therefore, we shall start important algorithms with knot insertion. In the following, we shall present an algorithm for inserting a single knot, followed by an algorithm for inserting a single knot multiple times.

The left figure below shows a clamped B-spline curve of degree 4 with uniform knots, while the right figure shows the result after a new knot u = 0.5 is inserted. The left figure also shows the control polylines before and after the insertion. As you can see, the shape of the curve does not change. However, the defining control polyline is changed. In fact, four new control points in red replace the original control points P₄, P₅ and P₆, and three line segments in yellow cut the corners at P₄, P₅ and P₆.

Inserting a Single Knot

Suppose the new knot t lies in knot span [u_k, u_k+1). From the strong convex hull property, C(t) lies in the convex hull defined by control points P_k, P_k-1, ..., P_k-p and the basis functions of all other control points are zero. Thus, the knot insertion computation can be restricted on control points P_k, P_k-1, ..., P_k-p. The way of inserting t is to find p new control points Q_k on leg P_k-1P_k, Q_k-1 on leg P_k-2P_k-1, ..., and Q_k-p+1 on leg P_k-pP_k-p+1 such that the old polyline between P_k-p and P_k (in black below) is replaced by P_k-pQ_k-p+1...Q_kP_k (in orange below) by cutting the corners at P_k-p+1, ..., P_k-1. All other control points are unchanged. Note that p-1 control points of the original control polyline are removed and replaced with p new control points.

Fortunately, the positions of new control points Q_i's are easy to compute. The formula for computing the new control point Q_i on leg P_i-1P_i is the following:

where the ratio a_i is computed as below:

In summary, to insert a new knot t, we first find the knot span [u_k, u_k+1) that contains t. With k available, p new control points Q_k-p+1, ..., Q_k are computed with the above formula. Finally, the original control polyline between P_k-p and P_k is replaced with the new polyline defined by P_k-p, Q_k-p+1, Q_k-p+2, ..., Q_k-1, Q_k and P_k. Note that after inserting a new knot, the knot vector becomes u₀, u₁, ..., u_k, t, u_k+1, ..., and u_m. If the new knot t is equal to u_k, the multiplicity of u_k is increased by one.

The above computation scheme can be illustrated with the following diagram. First, the affected control points are listed on the left column. Then, the computed new control points are listed on the second column. Note that the number of new control points is one less than the affected control points. The computation of new control point Q_i, where k-p+1 <= i <= k, requires two original control points P_i-1 and P_i with coefficients 1-a_i and a_i, respectively. After the computation, use the points surrounded by the blue dotted line to replace those not in the region. All unaffected control points are preserved. Therefore, the original set of control points P_k-p, P_k-p+1, ..., P_k-1, P_k is replaced with P_k-p, Q_k-p+1, ..., Q_k-1, P_k.

Let us take a look at a geometric interpretation of a_i. From its definition, a_i:1-a_i is the ratio of dividing interval [u_i, u_i+p) by the value of t as shown below:

There are k a_i's, each of which covers p knot spans (i.e., [u_i, u_i+p)). If we stack these intervals together and align them at the value of t, we have the following diagram:

Therefore, the position of t divides knot spans [u_k, u_k+p), [u_k-1, u_k+p-1), ..., [u_k-p+1, u_k+1) into ratios a_k, a_k-1, ...,, a_k-p+1, which, in turn, provide the ratios for dividing legs P_kP_k-1, P_k-1P_k-2, ... P_k-pP_k-p+1.

Example 1: Inserting a Knot in a Knot Span

Suppose we have a B-spline curve of degree 3 with a knot vector as follows:

We want to insert a new knot t = 0.5. Since t = 0.5 lies in knot span [u₅,u₆), the affected control points are P₅, P₄, P₃ and P₂. To determine the three new control points Q₅, Q₄ and Q₃, we need to compute a₅, a₄ and a₃ as follows:

The three new control points are

The new control polyline becomes P₀, P₁, P₂, Q₃, Q₄, Q₅, P₅, ...., and the new knot vector is

Since the original B-spline curve has p = 3 and m = 11, we have n = m - p - 1 = 11 - 3 - 1 = 7 and hence 8 control points. The following is a B-spline curve satisfying this condition and its basis functions:

The three blue rectangles are Q₃, Q₄ and Q₅. After inserting t = 0.5, the corners at P₃ and P₄ are cut, yielding the following B-spline curve and its basis functions. Note that the shape of the curve does not change:

The following diagram shows the relationship between the old and new control points. Note that the new set of control points contains P₀, P₁, P₂, Q₃, Q₄, Q₅, P₅, P₆ and P₇.

The relationship among a_j's, u_j's, and t are shown below:

Example 2: Inserting a Knot at an Existing Simple Knot

We want to insert a new knot t = 0.5, which is equal to an existing one (i.e., t = u₈ = 0.5). The following is a B-spline curve of degree 4 and its basis functions before the new knot t is inserted.

Since t is in [u₈,u₉), the affected control points are P₈, P₇, P₆, P₅ and P₄. The coefficients are computed as follows:

The new control points are

The new control point Q₈ is equal to the original control point P₇. In fact, if t is equal to a knot, say u_k, then

Consequently, we have

That is, if the new knot t to be inserted is equal to an existing simple knot u_k, then Q_k, the last new control point, is equal to P_k-1. The following diagram shows the computation scheme:

The figure shown at the beginning of this example shows the new control points and the new control polyline in orange, Note that the new control points are P₀, P₁, P₂, P₃, P₄, Q₅, Q₆, Q₇, Q₈ = P₇, P₈, P₉, P₁₀ and P₁₁. The curve and its basis functions after the new knot t = 0.5 is inserted is shown below.

The relationship among a_j's, u_j's, and t are shown below:

Example 3: Inserting a Knot at an Existing Multiple Knot

What if the new knot t is inserted at a multiple knot? Suppose t is inserted at knot u_k of multiplicity s. Hence, we have s consecutive equal knots: u_k = u_k-1 = u_k-2 = .... = u_k-s+1 and u_k-s+1 being not equal to u_k-s. In the computation of coefficients a_k, ...., a_k-p+1, we have the following:

Hence, coefficients a_k, ...., a_k-p+1 are all zero and, consequently, we have

This shows that if the new knot t is inserted at a knot u_k of multiplicity s, then the last s new control points, Q_k, Q_k-1, ..., Q_k-s+1 are equal to the original control points P_k-1, P_k-2, ..., P_k-s. If s = 1 (i.e., simple knot), Q_k is equal to P_k-1, which is exactly what is discussed in Example 2. If s = 0 (i.e., t is not a knot), then all control points from P_k-p to P_k are involved. This is the case of Example 1. The following diagram shows the computation scheme: