Algorithms for degree-raising of splines
From MaRDI portal
Publication:3719701
DOI10.1145/282957.282962zbMath0591.65012OpenAlexW2072874134MaRDI QIDQ3719701
Tom Lyche, Larry L. Schumaker, Elaine Cohen
Publication date: 1985
Published in: ACM Transactions on Graphics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/282957.282962
computer-aided geometric designsurfacesB-splinesdegree-raising of curvesminimal number of knot insertions
Related Items
Injectivity of NURBS curves ⋮ Degree raising for splines ⋮ Hybrid-degree weighted T-splines and their application in isogeometric analysis ⋮ Algorithms for computing the approximation of offsets of toric Bézier curves ⋮ A matrix method for degree-raising of B-spline curves ⋮ Unnamed Item ⋮ A simple, efficient degree raising algorithm for B-spline curves ⋮ Dimension elevation for Chebyshevian splines ⋮ Recursive representation and application of transformation matrices of B-spline bases ⋮ MCAD: key historical developments ⋮ A fast algorithm to raise the degree of spline curves ⋮ Geometric conditions of non-self-intersecting NURBS surfaces ⋮ Approximation of high-degree and procedural curves ⋮ Degree elevation of changeable degree spline ⋮ On the degree elevation of B-spline curves and corner cutting ⋮ Approximate conversion of rational splines ⋮ Approximate conversion of rational B-spline patches ⋮ Automatic segmentation and approximation of digitized data for reverse engineering ⋮ Fast degree elevation and knot insertion for B-spline curves ⋮ Some identities for product and degree raising of splines
