Matrix based subdivision depth computation for extra-ordinary catmull-clark subdivision surface patches

Authors:
Gang Chen;Fuhua (Frank) Cheng
Affiliations:
Graphics & Geometric Modeling Lab, Department of Computer Science, University of Kentucky, Lexington, Kentucky;Graphics & Geometric Modeling Lab, Department of Computer Science, University of Kentucky, Lexington, Kentucky
Venue:
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Year:
2006

Citing 3
Cited 4

Efficient, fair interpolation using Catmull-Clark surfaces

SIGGRAPH '93 Proceedings of the 20th 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
Subdivision depth computation for extra-ordinary catmull-clark subdivision surface patches

CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics

Distance between a Catmull-Clark subdivision surface and its limit mesh

Proceedings of the 2007 ACM symposium on Solid and physical modeling
A bound on the approximation of a Catmull--Clark subdivision surface by its limit mesh

Computer Aided Geometric Design
The distance of a subdivision surface to its control polyhedron

Journal of Approximation Theory
Beyond Catmull–Clark? A Survey of Advances in Subdivision Surface Methods

Computer Graphics Forum

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new subdivision depth computation technique for extra-ordinary Catmull-Clark subdivision surface (CCSS) patches is presented. The new technique improves a previous technique by using a matrix representation of the second order norm in the computation process. This enables us to get a more precise estimate of the rate of convergence of the second order norm of an extra-ordinary CCSS patch and, consequently, a more precise subdivision depth for a given error tolerance.