Degree raising for splines (Q1089850): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0021-9045(86)90059-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1965691524 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4112369 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for degree-raising of splines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interactive Interpolation and Approximation by Bezier Polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Total positivity of the discrete spline collocation matrix / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4075369 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3855631 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3895980 / rank | |||
Normal rank |
Latest revision as of 20:10, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Degree raising for splines |
scientific article |
Statements
Degree raising for splines (English)
0 references
1986
0 references
The authors study the problem of converting an mth order B-spline expansion into an equivalent \((m+1)th\) order B-spline expansion. Let a spline \(s=\sum^{n}_{i=1}c_ iN^ m_ i\) be given, where \(\{N^ m_ i\}^ n_ 1\) are normalized B-splines of order m associated with a knot sequence \(\tau_ 1,...,\tau_ k\) of multiplicities \(m_ 1,...,m_ k\). It is shown that s can be represented in the form \(s=\sum^{\tilde n}_{j=1}\tilde c_ j\tilde N_ j^{m+1}\), where \(\{\tilde N_ j^{m+1}\}_ 1^{\tilde n}\) are normalized B-splines of order \(m+1\) associated with the knot sequence \(\tau_ 1,...,\tau_ k\) of multiplicities \(m_ 1+1,...,m_ k+1\). Moreover, formulae for computing the coefficients \(\tilde c_ 1,...,\tilde c_{\tilde n}\) are derived. By using discrete B-splines a recursion relation is established which plays an important role in computing these coefficients. It is pointed out that these results can be used in computer-aided design to obtain flexibility in manipulating the shape of a given spline curve by degree raising.
0 references
B-spline expansion
0 references
computer-aided design
0 references