In the mathematical subfield of numerical analysis, a B-spline or basis spline is a spline function that has minimal support with respect to a given degree, smoothness, and domain partition. Any spline function of given degree can be expressed as a linear combination of B-splines of that degree. Cardinal B-splines have knots that are equidistant from each other. B-splines can be used for curve-fitting and numerical differentiation of experimental data.
In computer-aided design and computer graphics, spline functions are constructed as linear combinations of B-splines with a set of control points.
The term "B-spline" was coined by Isaac Jacob Schoenberg and is short for basis spline.
A spline function of order is a piecewise polynomial function of degree in a variable . The places where the pieces meet are known as knots. The key property of spline functions is that they and their derivatives may be continuous, depending on the multiplicities of the knots.
B-splines of order are basis functions for spline functions of the same order defined over the same knots, meaning that all possible spline functions can be built from a linear combination of B-splines, and there is only one unique combination for each spline function.
A spline of order is a piecewise polynomial function of degree in a variable . The values of where the pieces of polynomial meet are known as knots, denoted and sorted into nondecreasing order. When the knots are distinct, the first derivatives of the polynomial pieces are continuous across each knot. When knots are coincident, then only the first derivatives of the spline are continuous across that knot.
For a given sequence of knots, there is, up to a scaling factor, a unique spline satisfying
If we add the additional constraint that for all between the first and last knot, then the scaling factor of becomes fixed. The resulting spline functions are called B-splines.
Alternatively, B-splines can be defined by construction by means of the Cox–de Boor recursion formula.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
The students study and apply fundamental concepts and algorithms of computer graphics for rendering, geometry
synthesis, and animation. They design and implement their own interactive graphics program
The course provides an introduction to the study of curves and surfaces in Euclidean spaces. We will learn how we can apply ideas from differential and integral calculus and linear algebra in order to
In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example of a polynomial of a single indeterminate x is x2 − 4x + 7. An example with three indeterminates is x3 + 2xyz2 − yz + 1. Polynomials appear in many areas of mathematics and science.
A Bézier curve ('bEz.i.ei ) is a parametric curve used in computer graphics and related fields. A set of discrete "control points" defines a smooth, continuous curve by means of a formula. Usually the curve is intended to approximate a real-world shape that otherwise has no mathematical representation or whose representation is unknown or too complicated. The Bézier curve is named after French engineer Pierre Bézier (1910–1999), who used it in the 1960s for designing curves for the bodywork of Renault cars.
We introduce several spatially adaptive model order reduction approaches tailored to non-coercive elliptic boundary value problems, specifically, parametric-in-frequency Helmholtz problems. The offline information is computed by means of adaptive finite el ...
2021
, ,
Region extraction is a very common task in both Computer Science and Engineering with several applications in object recognition and motion analysis, among others. Most of the literature focuses on regions delimited by straight lines, often in the special ...
2023
,
We focus on the generalized-interpolation problem. There, one reconstructs continuous-domain signals that honor discrete data constraints. This problem is infinite-dimensional and ill-posed. We make it well-posed by imposing that the solution balances data ...