TY - GEN
T1 - Near-optimum adaptive tessellation of general catmull-clark subdivision surfaces
AU - Lai, Shuhua
AU - Cheng, Fuhua
PY - 2006
Y1 - 2006
N2 - A new adaptive tessellation method for general Catmull-Clark subdivision surfaces is presented. Development of the new method is based on the observation that optimum adaptive tessellation for rendering purpose is a recursive error evaluation and globalization process. The adaptive tessellation process is done by generating an inscribing polyhedron to approximate the limit surface for each individual patch. The inscribing polyhedron is generated through an adaptive subdivision on the patch's parameter space driven by a recursive error evaluation process. This approach generates less faces in the resulting approximating mesh while meeting the given precision requirement. The crack problem is avoided through globalization of new vertices generated in the adaptive subdivision process of the parameter space. No crack-detection or crack-elimination is needed in the adaptive tessellation process. Therefore, no mesh element splitting to eliminate cracks is necessary. The new adaptive tessellation method can precisely measure the error for every point of the limit surface. Hence, it has complete control of the accuracy of the tessellation result.
AB - A new adaptive tessellation method for general Catmull-Clark subdivision surfaces is presented. Development of the new method is based on the observation that optimum adaptive tessellation for rendering purpose is a recursive error evaluation and globalization process. The adaptive tessellation process is done by generating an inscribing polyhedron to approximate the limit surface for each individual patch. The inscribing polyhedron is generated through an adaptive subdivision on the patch's parameter space driven by a recursive error evaluation process. This approach generates less faces in the resulting approximating mesh while meeting the given precision requirement. The crack problem is avoided through globalization of new vertices generated in the adaptive subdivision process of the parameter space. No crack-detection or crack-elimination is needed in the adaptive tessellation process. Therefore, no mesh element splitting to eliminate cracks is necessary. The new adaptive tessellation method can precisely measure the error for every point of the limit surface. Hence, it has complete control of the accuracy of the tessellation result.
UR - http://www.scopus.com/inward/record.url?scp=33746191708&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33746191708&partnerID=8YFLogxK
U2 - 10.1007/11784203_52
DO - 10.1007/11784203_52
M3 - Conference contribution
AN - SCOPUS:33746191708
SN - 354035638X
SN - 9783540356387
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 562
EP - 569
BT - Advances in Computer Graphics - 24th Computer Graphics International Conference, CGI 2006
T2 - 24th Computer Graphics International Conference, CGI 2006
Y2 - 26 June 2006 through 28 June 2006
ER -