Efficient, fair interpolation using Catmull-Clark surfaces
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Piecewise smooth surface reconstruction
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Exact evaluation of Catmull-Clark subdivision surfaces at arbitrary parameter values
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon
Computer Aided Geometric Design - Special issue dedicated to Paul de Faget de Casteljau
Best bounds on the approximation of polynomials and splines by their control structure
Computer Aided Geometric Design
Estimating subdivision depth of Catmull-Clark surfaces
Journal of Computer Science and Technology - Special issue on computer graphics and computer-aided design
Estimating error bounds for binary subdivision curves/surfaces
Journal of Computational and Applied Mathematics
Improved error estimate for extraordinary Catmull–Clark subdivision surface patches
The Visual Computer: International Journal of Computer Graphics
Subdivision depth computation for extra-ordinary catmull-clark subdivision surface patches
CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Integration of CAD and boundary element analysis through subdivision methods
Computers and Industrial Engineering
Beyond Catmull–Clark? A Survey of Advances in Subdivision Surface Methods
Computer Graphics Forum
Hi-index | 0.00 |
A Catmull-Clark subdivision surface (CCSS) is a smooth surface generated by recursively refining its control meshes, which are often used as linear approximations to the limit surface in geometry processing. For a given control mesh of a CCSS, by pushing the control points to their limit positions, another linear approximation-a limit mesh of the CCSS is obtained. In general a limit mesh might approximate a CCSS better than the corresponding control mesh. We derive a bound on the distance between a CCSS patch and its limit face in terms of the maximum norm of the second order differences of the control points and a constant that depends only on the valence of the patch. A subdivision depth estimation formula for the limit mesh approximation is also proposed. For a given error tolerance, fewer subdivision steps are needed if the refined control mesh is replaced with the corresponding limit mesh.