A fast algorithm to raise the degree of spline curves (Q1183518): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Algorithms for degree-raising of splines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Degree elevation of B-spline curves / rank | |||
Normal rank | |||
Latest revision as of 14:48, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm to raise the degree of spline curves |
scientific article |
Statements
A fast algorithm to raise the degree of spline curves (English)
0 references
28 June 1992
0 references
The content of this paper is a new algorithm for raising the degree of a spline curve written as a linear combination of \(B\)-splines. Such algorithms are used, for instance, to smooth splines or to find a common representation of two spline curves of different degree. The described algorithm is the fastest presently known. Its operation count depends linearly on the number of knots and linearly on the degree of the splines. The paper is based on the ideas of the first author [ibid. 1, 193-198 (1984; Zbl 0552.65011)]. An explicit pseudo-code is provided for both the non-periodic and the periodic case.
0 references
computer aided design
0 references
\(B\)-splines
0 references
splines
0 references
degree elevation
0 references
algorithm
0 references
