A simple, efficient degree raising algorithm for B-spline curves

DOI10.1016/S0167-8396(96)00060-XzbMath0896.65005OpenAlexW2058101632MaRDI QIDQ1391164

Wayne Liu

Publication date: 22 July 1998

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8396(96)00060-x

zbMATH Keywords

algorithmsplines\(B\)-splinesdegree elevationblossoming

Mathematics Subject Classification ID

Numerical computation using splines (65D07)

Related Items (8)

Dimension and basis construction for analysis-suitable \(G^1\) two-patch parameterizations ⋮ Dimension elevation for Chebyshevian splines ⋮ Raising the approximation order of multivariate quasi-interpolants ⋮ Dimension and basis construction for \(C^2\)-smooth isogeometric spline spaces over bilinear-like \(G^2\) two-patch parameterizations ⋮ Degree elevation for \(n-\)sided surfaces ⋮ Degree elevation of changeable degree spline ⋮ On the degree elevation of B-spline curves and corner cutting ⋮ Fast degree elevation and knot insertion for B-spline curves

Cites Work

• Unnamed Item
• Degree elevation of B-spline curves
• A fast algorithm to raise the degree of spline curves
• Software-engineering approach to degree elevation of \(B\)-spline curves
• Algorithms for degree-raising of splines

This page was built for publication: A simple, efficient degree raising algorithm for B-spline curves