A simple, efficient degree raising algorithm for B-spline curves
From MaRDI portal
Recommendations
Cites work
Cited in
(17)- A recursive proof of a B-spline identity for degree elevation
- A fast algorithm to raise the degree of spline curves
- Erratum: A fast algorithm to raise the degree of spline curves
- A matrix method for degree-raising of B-spline curves
- Dimension and basis construction for C^2-smooth isogeometric spline spaces over bilinear-like G^2 two-patch parameterizations
- Dimension and basis construction for analysis-suitable \(G^1\) two-patch parameterizations
- Fast degree elevation and knot insertion for B-spline curves
- Efficient algorithms for the implementations of B-splines
- Algorithms for degree-raising of splines
- scientific article; zbMATH DE number 1215109 (Why is no real title available?)
- Raising the approximation order of multivariate quasi-interpolants
- scientific article; zbMATH DE number 2091824 (Why is no real title available?)
- Degree elevation for \(n-\)sided surfaces
- Degree elevation of changeable degree spline
- Increasing the degree of closed B-spline curves
- Dimension elevation for Chebyshevian splines
- On the degree elevation of B-spline curves and corner cutting
This page was built for publication: A simple, efficient degree raising algorithm for B-spline curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1391164)