The sharp upper bound on the distance between a parametric patch and its interpolated triangle  

作　　者：ZHANG Ren Jiang WANG GuoJin 

机构地区：[1]College of Science, China Jiliang University, Hangzhou 310018, China [2]State Key Laboratory of CAD and CG, Zhejiang University, Hangzhou 310027, China

出　　处：《Science in China(Series F)》2008年第2期113-119,共7页中国科学（F辑英文版）

基　　金：Supported by the National Basic Research Program of China(Grant No.2004CB719400);the National Natural Science Foundation of China(Grant Nos,60673031 and 60503057);the Natural Science Foundation of Zhejiang Province(Grant No.Y607034)

摘　　要：In computer aided geometric design （CAGD） and computer graphics, it is a general manipulation to approximate a surface by triangulation mesh. Thus a key problem is to estimate the error of the approximation. So far, many papers have given various estimate bounds of the distance between a parametric patch of a C2 surface and an arbitrary triangle whose vertices are on the patch, but these estimates are all imperfect, some of them have large error, some of them have complicated representation formulae. By using a succinct new method, a sharp upper estimate of the maximum distance between a patch and a triangle is obtained and a strict proof is given. This is very valuable for CAGD.In computer aided geometric design （CAGD） and computer graphics, it is a general manipulation to approximate a surface by triangulation mesh. Thus a key problem is to estimate the error of the approximation. So far, many papers have given various estimate bounds of the distance between a parametric patch of a C2 surface and an arbitrary triangle whose vertices are on the patch, but these estimates are all imperfect, some of them have large error, some of them have complicated representation formulae. By using a succinct new method, a sharp upper estimate of the maximum distance between a patch and a triangle is obtained and a strict proof is given. This is very valuable for CAGD.

关 键 词：computer aided geometric design parametric patch TRIANGULATION bound of approximation 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]