Convergence of subdivision and degree elevation

DOI10.1007/BF02519040zbMath0829.65012OpenAlexW2066332659MaRDI QIDQ1895905

Leif Kobbelt, Hartmut Prautzsch

Publication date: 21 January 1996

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02519040

zbMATH Keywords

convergencesubdivisiondegree elevationcontrol polygonsbox- splinesmultivariate Bézier polynomials

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items

The Rate of Approximation by Rational Bernstein Functions in Terms of Second Order Moduli of Continuity ⋮ Global optimization with spline constraints: a new branch-and-bound method based on B-splines ⋮ Arbitrarily high degree elevation of Bézier representations ⋮ A refinable space of smooth spline surfaces of arbitrary topological genus ⋮ Bézier clipping is quadratically convergent ⋮ The Bernstein polynomial basis: a centennial retrospective ⋮ Approximation of a continuous curve by its Bernstein-Bézier operator ⋮ Dimension elevation in Müntz spaces: a new emergence of the Müntz condition ⋮ Least squares methods for solving differential equations using Bézier control points. ⋮ On the Lorentz degree of a product of polynomials ⋮ A blossoming approach to accuracy of the degree elevation process ⋮ On the degree elevation of Bernstein polynomial representation ⋮ Quantum Lorentz degrees of polynomials and a Pólya theorem for polynomials positive on \(q\)-lattices ⋮ On the smooth convergence of subdivision and degree elevation for Bézier curves ⋮ A generalization of rational Bernstein-Bézier curves ⋮ Subdivision methods for solving polynomial equations ⋮ An effective bound on the gap between the control polytype and the graph of a real polynomial on a simplex ⋮ The distance of a subdivision surface to its control polyhedron ⋮ \(q\)-Bernstein polynomials and Bézier curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short proof of the Oslo algorithm
• Subdivision algorithms converge quadratically
• Rates of convergence of control polygons
• On the convergence rates of subdivision algorithms for box spline surfaces
• Cutting corners always works
• Uniform refinement of curves
• A fast algorithm to raise the degree of spline curves
• Linear subdivision
• A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
• Stationary subdivision
• On convex Bézier triangles