Journal of Approximation Theory
Real time spline curves from interactively sketched data
I3D '90 Proceedings of the 1990 symposium on Interactive 3D graphics
Closed smooth piecewise bicubic surfaces
ACM Transactions on Graphics (TOG)
Second-order surface analysis using hybrid symbolic and numeric operators
ACM Transactions on Graphics (TOG)
IEEE Computer Graphics and Applications
Fast degree elevation and knot insertion for B-spline curves
Computer Aided Geometric Design
On the degree elevation of B-spline curves and corner cutting
Computer Aided Geometric Design
Recursive representation and application of transformation matrices of B-spline bases
Computer Aided Geometric Design
Poisson based reuse of freeform features with NURBS representation
Computers in Industry
Fast degree elevation and knot insertion for B-spline curves
Computer Aided Geometric Design
Dimension elevation for Chebyshevian splines
Numerical Algorithms
| Hi-index | 0.00 |
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 mth 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.