Efficient, fair interpolation using Catmull-Clark surfaces
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Interactive multiresolution mesh editing
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Non-uniform recursive subdivision surfaces
Proceedings of the 25th 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
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Approximate Boolean operations on free-form solids
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
An Accurate Error Measure for Adaptive Subdivision Surfaces
SMI '05 Proceedings of the International Conference on Shape Modeling and Applications 2005
Trimming for subdivision surfaces
Computer Aided Geometric Design
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
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Beyond Catmull–Clark? A Survey of Advances in Subdivision Surface Methods
Computer Graphics Forum
| Hi-index | 0.00 |
A second order forward differences based subdivision depth computation technique for extra-ordinary Catmull-Clark subdivision surface (CCSS) patches is presented. The new technique improves a previous technique in that the computation of the subdivision depth is based on the patch's curvature distribution, instead of its dimension. Hence, with the new technique, no excessive subdivision is needed for extra-ordinary CCSS patches to meet the precision requirement and, consequently, one can make trimming, finite element mesh generation, boolean operations, and tessellation of CCSSs more efficient.