Computational formula of depth for Catmull-Clark subdivision surfaces

Authors:
Xiao-Ming Zeng;X. J. Chen
Affiliations:
Department of Mathematics, Xiamen University, Xiamen, PR China;Department of Mathematics, Xiamen University, Xiamen, PR China
Venue:
Journal of Computational and Applied Mathematics - Special issue: The international symposium on computing and information (ISCI2004)
Year:
2006

Citing 7
Cited 2

Efficient, fair interpolation using Catmull-Clark surfaces

SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
A unified approach to subdivision algorithms near extraordinary vertices

Computer Aided Geometric Design
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
Normal bounds for subdivision-surface interference detection

Proceedings of the conference on Visualization '01
Trimming for subdivision surfaces

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

In this paper, by introducing the concept of neighbor points and using the first-order difference of control points of Catmull-Clark surfaces, we obtain the rate of convergence of control meshes of Catmull-Clark surface. By the result of convergence we derive a computational formula of subdivision depth for Catmull-Clark surfaces.