Spline (mathematics)

Single knots at 1/3 and 2/3 establish a spline of three cubic polynomials meeting with

C 2

parametric continuity. Triple knots at both ends of the interval ensure that the curve interpolates the end points

In mathematics, a spline is a function defined piecewise by polynomials. In interpolating problems, spline interpolation is often preferred to polynomial interpolation because it yields similar results, even when using low degree polynomials, while avoiding Runge's phenomenon for higher degrees.

In the computer science subfields of computer-aided design and computer graphics, the term spline more frequently refers to a piecewise polynomial (parametric) curve. Splines are popular curves in these subfields because of the simplicity of their construction, their ease and accuracy of evaluation, and their capacity to approximate complex shapes through curve fitting and interactive curve design.

The term spline comes from the flexible spline devices used by shipbuilders and draftsmen to draw smooth shapes.

Introduction

The term "spline" is used to refer to a wide class of functions that are used in applications requiring data interpolation and/or smoothing. The data may be either one-dimensional or multi-dimensional. Spline functions for interpolation are normally determined as the minimizers of suitable measures of roughness (for example integral squared curvature) subject to the interpolation constraints. Smoothing splines may be viewed as generalizations of interpolation splines where the functions are determined to minimize a weighted combination of the average squared approximation error over observed data and the roughness measure. For a number of meaningful definitions of the roughness measure, the spline functions are found to be finite dimensional in nature, which is the primary reason for their utility in computations and representation. For the rest of this section, we focus entirely on one-dimensional, polynomial splines and use the term "spline" in this restricted sense.

Definition

We begin by limiting our discussion to polynomials in one variable. In this case, a spline is a piecewise polynomial function. This function, call it $S$ , takes values from an interval $[a, b]$ and maps them to $\mathbb {R} ,$ the set of real numbers,

S:[a,b]\to \mathbb {R} .

We want $S$ to be piecewise defined. To accomplish this, let the interval $[a, b]$ be covered by $k$ ordered, disjoint subintervals,

{\begin{aligned}&[t_{i},t_{i+1}],\quad i=0,\ldots ,k-1\\[4pt]&[a,b]=[t_{0},t_{1})\cup [t_{1},t_{2})\cup \cdots \cup [t_{k-2},t_{k-1})\cup [t_{k-1},t_{k})\cup [t_{k}]\\[4pt]&a=t_{0}\leq t_{1}\leq \cdots \leq t_{k-1}\leq t_{k}=b\end{aligned}}

On each of these $k$ "pieces" of $[a, b]$ , we want to define a polynomial, call it $P i$ .

P_{i}:[t_{i},t_{i+1}]\to \mathbb {R} .

On the $i$ th subinterval of $[a, b]$ , $S$ is defined by $P i$ ,

{\begin{aligned}S(t)&=P_{0}(t),&&t_{0}\leq t<t_{1},\\[2pt]S(t)&=P_{1}(t),&&t_{1}\leq t<t_{2},\\&\vdots \\S(t)&=P_{k-1}(t),&&t_{k-1}\leq t\leq t_{k}.\end{aligned}}

The given $k + 1$ points $t i$ are called knots. The vector $t = (t 0, \dots, t k)$ is called a knot vector for the spline. If the knots are equidistantly distributed in the interval $[a, b]$ we say the spline is uniform, otherwise we say it is non-uniform.

If the polynomial pieces $P i$ each have degree at most $n$ , then the spline is said to be of degree $\leq n$ (or of order $n + 1$ ).

If $S\in C^{r_{i}}$ in a neighborhood of $t i$ , then the spline is said to be of smoothness (at least) $C^{r_{i}}$ at $t i$ . That is, at $t i$ the two polynomial pieces $P i -1$ and $P i$ share common derivative values from the derivative of order 0 (the function value) up through the derivative of order $r i$ (in other words, the two adjacent polynomial pieces connect with loss of smoothness of at most $n - r i$ )

{\begin{aligned}P_{i-1}^{(0)}(t_{i})&=P_{i}^{(0)}(t_{i}),\\[2pt]P_{i-1}^{(1)}(t_{i})&=P_{i}^{(1)}(t_{i}),\\\vdots &\\P_{i-1}^{(r_{i})}(t_{i})&=P_{i}^{(r_{i})}(t_{i}).\end{aligned}}

A vector $r = (r 1, \dots, r k -1)$ such that the spline has smoothness $C^{r_{i}}$ at $t i$ for $i = 1, \dots, k - 1$ is called a smoothness vector for the spline.

Given a knot vector $t$ , a degree $n$ , and a smoothness vector $r$ for $t$ , one can consider the set of all splines of degree $\leq n$ having knot vector $t$ and smoothness vector $r$ . Equipped with the operation of adding two functions (pointwise addition) and taking real multiples of functions, this set becomes a real vector space. This spline space is commonly denoted by $S_{n}^{\mathbf {r} }(\mathbf {t} ).$

In the mathematical study of polynomial splines the question of what happens when two knots, say $t i$ and $t i +1$ , are taken to approach one another and become coincident has an easy answer. The polynomial piece $P i (t)$ disappears, and the pieces $P i -1 (t)$ and $P i +1 (t)$ join with the sum of the smoothness losses for $t i$ and $t i +1$ . That is,

S(t)\in C^{n-j_{i}-j_{i+1}}[t_{i}=t_{i+1}],

where $j i = n - r i$ .

This leads to a more general understanding of a knot vector. The continuity loss at any point can be considered to be the result of multiple knots located at that point, and a spline type can be completely characterized by its degree $n$ and its extended knot vector

(t_{0},t_{1},\cdots ,t_{1},t_{2},\cdots ,t_{2},t_{3},\cdots ,t_{k-2},t_{k-1},\cdots ,t_{k-1},t_{k})

where $t i$ is repeated $j i$ times for $i = 1, \dots, k - 1$ .

A parametric curve on the interval $[a, b]$

G(t)={\bigl (}X(t),Y(t){\bigr )},\quad t\in [a,b]

is a spline curve if both $X$ and $Y$ are spline functions of the same degree with the same extended knot vectors on that interval.

Examples

Suppose the interval $[a, b]$ is $[0, 3]$ and the subintervals are $[0, 1], [1, 2], [2, 3]$ . Suppose the polynomial pieces are to be of degree 2, and the pieces on $[0, 1]$ and $[1, 2]$ must join in value and first derivative (at $t = 1$ ) while the pieces on $[1, 2]$ and $[2, 3]$ join simply in value (at $t = 2$ ). This would define a type of spline $S (t)$ for which

{\begin{aligned}S(t)&=P_{0}(t)=-1+4t-t^{2},&&0\leq t<1\\[2pt]S(t)&=P_{1}(t)=2t,&&1\leq t<2\\[2pt]S(t)&=P_{2}(t)=2-t+t^{2},&&2\leq t\leq 3\end{aligned}}

would be a member of that type, and also

{\begin{aligned}S(t)&=P_{0}(t)=-2-2t^{2},&&0\leq t<1\\[2pt]S(t)&=P_{1}(t)=1-6t+t^{2},&&1\leq t<2\\[2pt]S(t)&=P_{2}(t)=-1+t-2t^{2},&&2\leq t\leq 3\end{aligned}}

would be a member of that type. (Note: while the polynomial piece $2 t$ is not quadratic, the result is still called a quadratic spline. This demonstrates that the degree of a spline is the maximum degree of its polynomial parts.) The extended knot vector for this type of spline would be $(0, 1, 2, 2, 3)$ .

The simplest spline has degree 0. It is also called a step function. The next most simple spline has degree 1. It is also called a linear spline. A closed linear spline (i.e, the first knot and the last are the same) in the plane is just a polygon.

A common spline is the natural cubic spline. A cubic spline has degree 3 with continuity $C 2$ , i.e. the values and first and second derivatives are continuous. Natural means that the second derivatives of the spline polynomials are zero at the endpoints of the interval of interpolation.

S''(a)\,=S''(b)=0.

Thus, the graph of the spline is a straight line outside of the interval, but still smooth.

Algorithm for computing natural cubic splines

Cubic splines are of the form

S_{j}(x)=a_{j}+b_{j}(x-x_{j})+c_{j}(x-x_{j})^{2}+d_{j}(x-x_{j})^{3}.

Given set of coordinates

C={\bigl [}(x_{0},y_{0}),(x_{1},y_{1}),...,(x_{n},y_{n}){\bigr ]},

we wish to find set of $n$ splines $S i (x)$ for $i = 0, \dots, n - 1$ .

These must satisfy:

{\begin{aligned}S_{i}(x_{i})&=y_{i}=S_{i-1}(x_{i}),&&i=1,\ \ldots ,\ n-1,\\[4pt]S_{0}(x_{0})&=y_{0},\\[4pt]S_{n-1}(x_{n})&=y_{n},\\[4pt]S'_{i}(x_{i})&=S'_{i-1}(x_{i}),&&i=1,\ \ldots ,\ n-1,\\[4pt]S''_{i}(x_{i})&=S''_{i-1}(x_{i}),&&i=1,\ \ldots ,\ n-1,\\[4pt]S''_{0}(x_{0})&=S''_{n-1}(x_{n})=0.\end{aligned}}

Let us define one cubic spline $S$ as a 5-tuple $(a, b, c, d, x t)$ where $a, b, c, d$ correspond to coefficients in the form shown earlier and $x t$ is equal to $x j$ .

Algorithm for computing Natural Cubic Splines:
Input: set of coordinates $C$ , with $| C | = n + 1$
Output: set splines which is composed of $n$ 5-tuples.

Create new array $a$ of size $n + 1$ and for $i = 0, \dots, n$ set $a_{i}=y_{i}\,$
Create new arrays $b$ and $d$ , each of size $n$ .
Create new array $h$ of size $n$ and for $i = 0, \dots, n - 1$ set $h_{i}=x_{i+1}-x_{i}\,$
Create new array $α$ of size $n$ and for $i = 1, \dots, n - 1$ set $\alpha _{i}={\frac {3}{h_{i}}}(a_{i+1}-a_{i})-{\frac {3}{h_{i-1}}}(a_{i}-a_{i-1}).$
Create new arrays $c, l, μ, z$ , each of size $n + 1$ .
Set $l_{0}=1,{\mu }_{0}=z_{0}=0\,$
For $i = 1, \dots, n - 1$ set the following: ${\begin{aligned}l_{i}&=2(x_{i+1}-x_{i-1})-h_{i-1}\mu _{i-1},\\\mu _{i}&={\frac {h_{i}}{l_{i}}},\\z_{i}&={\frac {\alpha _{i}-h_{i-1}z_{i-1}}{l_{i}}}.\end{aligned}}$
Set $l_{n}=1;z_{n}=c_{n}=0.\,$
For $j = n - 1, n - 2, \dots, 0$ , set the following: ${\begin{aligned}c_{j}&=z_{j}-\mu _{j}c_{j+1},\\[4pt]b_{j}&={\frac {a_{j+1}-a_{j}}{h_{j}}}-{\frac {h_{j}(c_{j+1}+2c_{j})}{3}},\\[4pt]d_{j}&={\frac {c_{j+1}-c_{j}}{3h_{j}}}.\end{aligned}}$
Create new set Splines and call it output_set. Populate it with $n$ splines $S$ .
For $i = 0, \dots, n - 1$ set the following: ${\begin{aligned}S_{i,a}=a_{i},\\S_{i,b}=b_{i},\\S_{i,c}=c_{i},\\S_{i,d}=d_{i},\\S_{i,x}=x_{i}.\end{aligned}}$
Output output_set

C++ implementation:

#include <array>
template<int n>
std::array<std::array<float, 5>, n> natural_cubic_splines_impl(
	const std::array<float, n + 1>& x, 
	const std::array<float, n + 1>& y)
{
	std::array<float, n + 1> a;
	for (int i = 0; i <= n; i++)
		a[i] = y[i];
	std::array<float, n> b, d, h;
	for (int i = 0; i <= n - 1; i++)
		h[i] = x[i + 1] - x[i];
	std::array<float, n> alpha;
	for (int i = 1; i <= n - 1; i++)
		alpha[i] = 3.0f / h[i] * (a[i + 1] - 
			a[i]) - 3.0f / h[i - 1] * (a[i] - a[i - 1]);
	std::array<float, n + 1> c, l, mu, z;
	l[0] = 1, mu[0] = z[0] = 0;
	for (int i = 1; i <= n - 1; i++)
	{
		l[i] = 2 * (x[i + 1] - x[i - 1]) - h[i - 1] * mu[i - 1];
		mu[i] = h[i] / l[i];
		z[i] = (alpha[i] - h[i - 1] * z[i - 1]) / l[i];
	}
	l[n] = 1, z[n] = c[n] = 0;
	for (int j = n - 1; j >= 0; j--)
	{
		c[j] = z[j] - mu[j] * c[j + 1];
		b[j] = (a[j + 1] - a[j]) / h[j] - 
				(h[j] * (c[j + 1] + 2 * c[j])) / 3.0f;
		d[j] = (c[j + 1] - c[j]) / (3.0f * h[j]);
	}
	std::array<std::array<float, 5>, n> output_set;
	for (int i = 0; i <= n - 1; i++)
	{
		output_set[i][0] = a[i];
		output_set[i][1] = b[i];
		output_set[i][2] = c[i];
		output_set[i][3] = d[i];
		output_set[i][4] = x[i];
	}
	return output_set;
}

Notes

It might be asked what meaning more than $n$ multiple knots in a knot vector have, since this would lead to continuities like

S(t)\in C^{-m},\quad m>0

at the location of this high multiplicity. By convention, any such situation indicates a simple discontinuity between the two adjacent polynomial pieces. This means that if a knot $t i$ appears more than $n + 1$ times in an extended knot vector, all instances of it in excess of the $(n + 1)$ th can be removed without changing the character of the spline, since all multiplicities $n + 1$ , $n + 2$ , $n + 3$ , etc. have the same meaning. It is commonly assumed that any knot vector defining any type of spline has been culled in this fashion.

The classical spline type of degree $n$ used in numerical analysis has continuity

S(t)\in \mathrm {C} ^{n-1}[a,b],

which means that every two adjacent polynomial pieces meet in their value and first $n - 1$ derivatives at each knot. The mathematical spline that most closely models the flat spline is a cubic ( $n = 3$ ), twice continuously differentiable ( $C 2$ ), natural spline, which is a spline of this classical type with additional conditions imposed at endpoints $a$ and $b$ .

Another type of spline that is much used in graphics, for example in drawing programs such as Adobe Illustrator from Adobe Systems, has pieces that are cubic but has continuity only at most

S(t)\in C^{1}[a,b].

This spline type is also used in PostScript as well as in the definition of some computer typographic fonts.

Many computer-aided design systems that are designed for high-end graphics and animation use extended knot vectors, for example Autodesk Maya. Computer-aided design systems often use an extended concept of a spline known as a Nonuniform rational B-spline (NURBS).

If sampled data from a function or a physical object is available, spline interpolation is an approach to creating a spline that approximates that data.

General expression for a C² interpolating cubic spline

The general expression for the $i$ th $C 2$ interpolating cubic spline at a point x with the natural condition can be found using the formula

S_{i}(x)={\frac {z_{i}(x-t_{i-1})^{3}}{6h_{i}}}+{\frac {z_{i-1}(t_{i}-x)^{3}}{6h_{i}}}+\left[{\frac {f(t_{i})}{h_{i}}}-{\frac {z_{i}h_{i}}{6}}\right](x-t_{i-1})+\left[{\frac {f(t_{i-1})}{h_{i}}}-{\frac {z_{i-1}h_{i}}{6}}\right](t_{i}-x)

where

$z_{i}=S_{i}''(t_{i})$ are the values of the second derivative at the $i$ th knot.
$h_{i}=t_{i}-t_{i-1}$
$f(t_{i}^{})$ are the values of the function at the $i$ th knot.

Representations and names

For a given interval $[a, b]$ and a given extended knot vector on that interval, the splines of degree $n$ form a vector space. Briefly this means that adding any two splines of a given type produces spline of that given type, and multiplying a spline of a given type by any constant produces a spline of that given type. The dimension of the space containing all splines of a certain type can be counted from the extended knot vector:

{\begin{aligned}a&=t_{0}<\underbrace {t_{1}=\cdots =t_{1}} _{j_{1}}<\cdots <\underbrace {t_{k-2}=\cdots =t_{k-2}} _{j_{k-2}}<t_{k-1}=b\\[4pt]j_{i}&\leq n+1,\qquad i=1,\ldots ,k-2.\end{aligned}}

The dimension is equal to the sum of the degree plus the multiplicities

d=n+\sum _{i=1}^{k-2}j_{i}.

If a type of spline has additional linear conditions imposed upon it, then the resulting spline will lie in a subspace. The space of all natural cubic splines, for instance, is a subspace of the space of all cubic C² splines.

The literature of splines is replete with names for special types of splines. These names have been associated with:

The choices made for representing the spline, for example:
- using basis functions for the entire spline (giving us the name B-splines)
- using Bernstein polynomials as employed by Pierre Bézier to represent each polynomial piece (giving us the name Bézier splines)
The choices made in forming the extended knot vector, for example:
- using single knots for $C n -1$ continuity and spacing these knots evenly on $[a, b]$ (giving us uniform splines)
- using knots with no restriction on spacing (giving us nonuniform splines)
Any special conditions imposed on the spline, for example:
- enforcing zero second derivatives at $a$ and $b$ (giving us natural splines)
- requiring that given data values be on the spline (giving us interpolating splines)

Often a special name was chosen for a type of spline satisfying two or more of the main items above. For example, the Hermite spline is a spline that is expressed using Hermite polynomials to represent each of the individual polynomial pieces. These are most often used with $n = 3$ ; that is, as Cubic Hermite splines. In this degree they may additionally be chosen to be only tangent-continuous ( $C 1$ ); which implies that all interior knots are double. Several methods have been invented to fit such splines to given data points; that is, to make them into interpolating splines, and to do so by estimating plausible tangent values where each two polynomial pieces meet (giving us Cardinal splines, Catmull-Rom splines, and Kochanek-Bartels splines, depending on the method used).

For each of the representations, some means of evaluation must be found so that values of the spline can be produced on demand. For those representations that express each individual polynomial piece $P i (t)$ in terms of some basis for the degree $n$ polynomials, this is conceptually straightforward:

For a given value of the argument $t$ , find the interval in which it lies $t\in [t_{i},t_{i+1}]$
Look up the polynomial basis chosen for that interval $P_{0},\ldots ,P_{k-2}$
Find the value of each basis polynomial at $t$ : $P_{0}(t),\ldots ,P_{k-2}(t)$
Look up the coefficients of the linear combination of those basis polynomials that give the spline on that interval $c 0, ..., c k -2$
Add up that linear combination of basis polynomial values to get the value of the spline at $t$ :

\sum _{j=0}^{k-2}c_{j}P_{j}(t).

However, the evaluation and summation steps are often combined in clever ways. For example, Bernstein polynomials are a basis for polynomials that can be evaluated in linear combinations efficiently using special recurrence relations. This is the essence of De Casteljau's algorithm, which features in Bézier curves and Bézier splines).

For a representation that defines a spline as a linear combination of basis splines, however, something more sophisticated is needed. The de Boor algorithm is an efficient method for evaluating B-splines.

History

Before computers were used, numerical calculations were done by hand. Although piecewise-defined functions like the sign function or step function were used, polynomials were generally preferred because they were easier to work with. Through the advent of computers, splines have gained importance. They were first used as a replacement for polynomials in interpolation, then as a tool to construct smooth and flexible shapes in computer graphics.

It is commonly accepted that the first mathematical reference to splines is the 1946 paper by Schoenberg, which is probably the first place that the word "spline" is used in connection with smooth, piecewise polynomial approximation. However, the ideas have their roots in the aircraft and shipbuilding industries. In the foreword to (Bartels et al., 1987), Robin Forrest describes "lofting", a technique used in the British aircraft industry during World War II to construct templates for airplanes by passing thin wooden strips (called "splines") through points laid out on the floor of a large design loft, a technique borrowed from ship-hull design. For years the practice of ship design had employed models to design in the small. The successful design was then plotted on graph paper and the key points of the plot were re-plotted on larger graph paper to full size. The thin wooden strips provided an interpolation of the key points into smooth curves. The strips would be held in place at discrete points (called "ducks" by Forrest; Schoenberg used "dogs" or "rats") and between these points would assume shapes of minimum strain energy. According to Forrest, one possible impetus for a mathematical model for this process was the potential loss of the critical design components for an entire aircraft should the loft be hit by an enemy bomb. This gave rise to "conic lofting", which used conic sections to model the position of the curve between the ducks. Conic lofting was replaced by what we would call splines in the early 1960s based on work by J. C. Ferguson at Boeing and (somewhat later) by M.A. Sabin at British Aircraft Corporation.

The word "spline" was originally an East Anglian dialect word.

The use of splines for modeling automobile bodies seems to have several independent beginnings. Credit is claimed on behalf of de Casteljau at Citroën, Pierre Bézier at Renault, and Birkhoff, Garabedian, and de Boor at General Motors (see Birkhoff and de Boor, 1965), all for work occurring in the very early 1960s or late 1950s. At least one of de Casteljau's papers was published, but not widely, in 1959. De Boor's work at General Motors resulted in a number of papers being published in the early 1960s, including some of the fundamental work on B-splines.

Work was also being done at Pratt & Whitney Aircraft, where two of the authors of (Ahlberg et al., 1967) — the first book-length treatment of splines — were employed, and the David Taylor Model Basin, by Feodor Theilheimer. The work at General Motors is detailed nicely in (Birkhoff, 1990) and (Young, 1997). Davis (1997) summarizes some of this material.

References

Ferguson, James C, Multi-variable curve interpolation, J. ACM, vol. 11, no. 2, pp. 221-228, Apr. 1964.
Ahlberg, Nielson, and Walsh, The Theory of Splines and Their Applications, 1967.
Birkhoff, Fluid dynamics, reactor computations, and surface representation, in: Steve Nash (ed.), A History of Scientific Computation, 1990.
Bartels, Beatty, and Barsky, An Introduction to Splines for Use in Computer Graphics and Geometric Modeling, 1987.
Birkhoff and de Boor, Piecewise polynomial interpolation and approximation, in: H. L. Garabedian (ed.), Proc. General Motors Symposium of 1964, pp. 164–190. Elsevier, New York and Amsterdam, 1965.
Davis, B-splines and Geometric design, SIAM News, vol. 29, no. 5, 1997.
Epperson, History of Splines, NA Digest, vol. 98, no. 26, 1998.
Stoer & Bulirsch, Introduction to Numerical Analysis. Springer-Verlag. p. 93-106. ISBN 0387904204
Schoenberg, Contributions to the problem of approximation of equidistant data by analytic functions, Quart. Appl. Math., vol. 4, pp. 45–99 and 112–141, 1946.
Young, Garrett Birkhoff and applied mathematics, Notices of the AMS, vol. 44, no. 11, pp. 1446–1449, 1997.
Chapra, Canale, "Numerical Methods for Engineers" 5th edition.
Larry, Schumaker, "Spline Functions: Computational Methods", SIAM, ISBN 978-1-611973-89-1, (2015).

External links

Theory

An Interactive Introduction to Splines, ibiblio.org

Excel Function

XLL Excel Addin Function Implementation of cubic spline

Online utilities

Online Cubic Spline Interpolation Utility
Learning by Simulations Interactive simulation of various cubic splines
Symmetrical Spline Curves, an animation by Theodore Gray, The Wolfram Demonstrations Project, 2007.

Computer Code

Notes, PPT, Mathcad, Maple, Mathematica, Matlab, Holistic Numerical Methods Institute
various routines, NTCC
Sisl: Opensource C-library for NURBS, SINTEF
VBA Spline Interpolation, vbnumericalmethods.com

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.