Estimating Subdivision Depth of Catmull-Clark Surfaces  

作　　者：Hua-WeiWang Kai-HuaiQin 

机构地区：[1]DepartmentofComputerScienceandTechnology,TsinghuaUniversity,Beijing100083,P.R.China

出　　处：《Journal of Computer Science & Technology》2004年第5期657-664,共8页计算机科学技术学报（英文版）

基　　金：国家自然科学基金，高等学校博士学科点专项科研项目，面向21世纪教育振兴行动计划(985计划)

摘　　要：In this paper, both general and exponential bounds of the distance between a uniform Catmull-Clark surface and its control polyhedron are derived. The exponential bound is independent of the process of subdivision and can be evaluated without recursive subdivision. Based on the exponential bound, we can predict the depth of subdivision within a user-specified error tolerance. This is quite useful and important for pre-computing the subdivision depth of subdivision surfaces in many engineering applications such as surface/surface intersection, mesh generation, numerical control machining and surface rendering.In this paper, both general and exponential bounds of the distance between a uniform Catmull-Clark surface and its control polyhedron are derived. The exponential bound is independent of the process of subdivision and can be evaluated without recursive subdivision. Based on the exponential bound, we can predict the depth of subdivision within a user-specified error tolerance. This is quite useful and important for pre-computing the subdivision depth of subdivision surfaces in many engineering applications such as surface/surface intersection, mesh generation, numerical control machining and surface rendering.

关 键 词：Catmull-Clark surface subdivision depth control polyhedron approximation error 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]