Algorithms for degree-raising of splines
- 1 July 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 4 (3) , 171-181
- https://doi.org/10.1145/282957.282962
Abstract
Stable and efficient algorithms for degree-raising of curves (or surfaces) represented as arbitrary B-splines are presented as a application of the solution to the theoretical problem of rewriting a curve written as a linear combination of m th order B-splines as a linear combination of ( m + 1)st order B-splines with a minimal number of knot insertions. This approach can be used to introduce additional degrees of freedom to a curve (or surface), a problem which naturally arises in certain circumstances in constructing mathematical models for computer-aided geometric design.Keywords
This publication has 5 references indexed in Scilit:
- Degree raising for splinesJournal of Approximation Theory, 1986
- Total positivity of the discrete spline collocation matrixJournal of Approximation Theory, 1983
- Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphicsComputer Graphics and Image Processing, 1980
- Inserting new knots into B-spline curvesComputer-Aided Design, 1980
- Interactive Interpolation and Approximation by Bezier PolynomialsThe Computer Journal, 1972