The distance of a subdivision surface to its control polyhedron
From MaRDI portal
Publication:1048973
DOI10.1016/j.jat.2008.10.012zbMath1185.41009OpenAlexW2060155980MaRDI QIDQ1048973
Publication date: 8 January 2010
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jat.2008.10.012
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 ⋮ Error bounds for Loop subdivision surfaces
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified approach to subdivision algorithms near extraordinary vertices
- Surface algorithms using bounds on derivatives
- Box splines
- 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
- Convergence of subdivision and degree elevation
- Subdivision surfaces
- Deformable surface modeling base on dual subdivision
- Computational formula of depth for Catmull-Clark subdivision surfaces
- Matrix Based Subdivision Depth Computation for Extra-Ordinary Catmull-Clark Subdivision Surface Patches
- Tight linear envelopes for splines
This page was built for publication: The distance of a subdivision surface to its control polyhedron