A fast algorithm to raise the degree of spline curves

DOI10.1016/0167-8396(91)90015-4zbMath0753.65008OpenAlexW2006737385MaRDI QIDQ1183518

Bruce Piper, Hartmut Prautzsch

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0167-8396(91)90015-4

zbMATH Keywords

algorithmsplinescomputer aided design\(B\)-splinesdegree elevation

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Spline approximation (41A15)

Related Items (17)

Injectivity of NURBS curves ⋮ Convergence of subdivision and degree elevation ⋮ Hybrid-degree weighted T-splines and their application in isogeometric analysis ⋮ A matrix method for degree-raising of B-spline curves ⋮ 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 ⋮ An isogeometric analysis approach for the study of the gyrokinetic quasi-neutrality equation ⋮ An arbitrary high-order spline finite element solver for the time domain Maxwell equations ⋮ Raising the approximation order of multivariate quasi-interpolants ⋮ Computing a chain of blossoms, with application to products of splines ⋮ Geometric conditions of non-self-intersecting NURBS surfaces ⋮ Computing a chain of blossoms, with application to products of splines ⋮ 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 ⋮ Remarks on an identity related to degree elevation

Cites Work

• Degree elevation of B-spline curves
• Algorithms for degree-raising of splines

This page was built for publication: A fast algorithm to raise the degree of spline curves