Estimating error bounds for quaternary subdivision schemes
From MaRDI portal
Publication:1029139
DOI10.1016/J.JMAA.2009.04.050zbMath1169.65017OpenAlexW2025656706MaRDI QIDQ1029139
Publication date: 9 July 2009
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2009.04.050
error boundcontrol polygonsubdivision depthforward differencesquaternary curve schemesSubdivision surfaces
Related Items (3)
A formula for estimating the deviation of a binary interpolatory subdivision curve from its data polygon ⋮ Subdivision depth computation for tensor product \(n\)-ary volumetric models ⋮ Interpolating \(m\)-refinable functions with compact support: the second generation class
Cites Work
- Unnamed Item
- Unnamed Item
- A bound on the approximation of a Catmull-Clark subdivision surface by its limit mesh
- Best bounds on the approximation of polynomials and splines by their control structure
- Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon
- Error estimate for Doo-Sabin surfaces
- Estimating error bounds for binary subdivision curves/surfaces
- Computational formula of depth for Catmull-Clark subdivision surfaces
- Estimating error bounds for tensor product binary subdivision volumetric model
- Estimating subdivision depths for rational curves and surfaces
- Tight linear envelopes for splines
This page was built for publication: Estimating error bounds for quaternary subdivision schemes