Abstract
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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
