Algorithms for degree-raising of splines
From MaRDI portal
Recommendations
Cited in
(28)- Degree raising for splines
- A fast algorithm to raise the degree of spline curves
- Approximation of high-degree and procedural curves
- Approximate conversion of rational splines
- A matrix method for degree-raising of B-spline curves
- A simple, efficient degree raising algorithm for B-spline curves
- \(B\)-splines of arbitrary degree
- On degree elevation of T-splines
- Hybrid-degree weighted T-splines and their application in isogeometric analysis
- Geometric conditions of non-self-intersecting NURBS surfaces
- Approximate conversion of rational B-spline patches
- Algorithms for computing the approximation of offsets of toric Bézier curves
- Fast degree elevation and knot insertion for B-spline curves
- Injectivity of NURBS curves
- New algorithms and techniques for computing with geometrically continuous spline curves of arbitrary degree
- scientific article; zbMATH DE number 1215109 (Why is no real title available?)
- Automatic segmentation and approximation of digitized data for reverse engineering
- scientific article; zbMATH DE number 1358053 (Why is no real title available?)
- scientific article; zbMATH DE number 1822288 (Why is no real title available?)
- scientific article; zbMATH DE number 2091824 (Why is no real title available?)
- scientific article; zbMATH DE number 939015 (Why is no real title available?)
- Degree elevation of changeable degree spline
- Dimension elevation for Chebyshevian splines
- Recursive representation and application of transformation matrices of B-spline bases
- MCAD: key historical developments
- On the degree elevation of B-spline curves and corner cutting
- Degree elevation of B-spline curves
- Some identities for product and degree raising of splines
This page was built for publication: Algorithms for degree-raising of splines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3719701)