Subdivision algorithms converge quadratically
From MaRDI portal
Recommendations
- Convergence of geometric subdivision schemes
- Subdivision algorithms with nonnegative masks generally converge
- A G^2-subdivision algorithm
- scientific article; zbMATH DE number 1281702
- scientific article; zbMATH DE number 5222615
- scientific article; zbMATH DE number 4000636
- On the subdivision strategy in adaptive quadrature algorithms
- Convergence rate of vector subdivision scheme
- On the convergence of convolved vector subdivision schemes
- Convergent vector and Hermite subdivision schemes
Cites work
- A practical guide to splines
- A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
- Adaptive contouring of three-dimensional surfaces
- Discrete box splines and refinement algorithms
- scientific article; zbMATH DE number 4056236 (Why is no real title available?)
- scientific article; zbMATH DE number 3703901 (Why is no real title available?)
- scientific article; zbMATH DE number 3535015 (Why is no real title available?)
- scientific article; zbMATH DE number 3238072 (Why is no real title available?)
- Local spline approximation methods
- Multidimensional Spline Approximation
- On the convergence rates of subdivision algorithms for box spline surfaces
- On the Linear Independence of Multivariate B-Splines, I. Triangulations of Simploids
- Subdivision algorithms for the generation of box spline surfaces
- The approximation of continuous functions by positive linear operators
Cited in
(14)- Subdivision methods for solving polynomial equations
- Compactly supported fundamental functions for spline interpolation
- Algorithms for generating B-nets and graphically displaying spline surfaces on three- and four-directional meshes
- Error estimates for approximations from control nets
- Subdivision algorithms with nonnegative masks generally converge
- Convergence of subdivision and degree elevation
- Control curves and knot intersection for trigonometric splines
- An \(\mathcal{O}(p^3)\) \(hp\)-version FEM in two dimensions: preconditioning and post-processing
- Computing the range of values of real functions using B-spline form
- Polytope-based computation of polynomial ranges
- The Bernstein polynomial basis: a centennial retrospective
- Regular algebraic curve segments (III) -- applications in interactive design and data fitting
- Introduction: Wolfgang Dahmen's mathematical work (as of 2009)
- On Chebyshevian spline subdivision
This page was built for publication: Subdivision algorithms converge quadratically
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078972)