De Boor's algorithm

This is an old revision of this page, as edited by Andris (talk | contribs) at 18:27, 5 April 2004. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, De Boor algorithm is an algorithm for evaluating spline curves.

The general setting is as follows. We would like to construct a curve passing through a sequence of points . The curve will be specified as a function of one parameter x. To pass through the sequence of points, the curve must satisfy . We assume that u0, ..., up are given to us along with .

One approach to solving this problem is by splines. A spline is a curve that is piecewise nth degree polynomial. This means that, on any interval [ui , ui+1), the curve must be equal to a polynomial of degree at most n. It may be equal to a different polynomials on different intervals. The polynomials must be synchronized: when the polynomials from intervals [ui-1 , ui) and [ui , ui+1) meet at the point ui, they must have the same value at this point and their derivatives must be equal (to ensure that the curve is smooth).

Goal of the algorithm

Suppose we want to evaluate the spline curve

 

defined on the interval   for a parameter value  . Due to the spline locality property, we can write

 

So the value   is determined by the controlpoints  ; the other control points have no influence. The goal of de Boor's algorithm is to evaluate   efficiently.

The algorithm

Suppose   and   for  . Now calculate

 

with

 

Then  .