Some estimates of the height of rational Bernstein-Bezier triangular surfaces

Subdivision, intersection and triangulation of a surface are the basic and common operations in computer aided design and computer graphics. A complicated surface can be approximated by some triangular patches. The key technique of this problem is the estimation of approximation error. This work has been done in some papers by estimating second derivatives of the surface, thus very complicated computation must be executed and hence time is overly consumed. Avoiding this estimation and exerting the influence of the control points of the surfaces, this paper gives a formula for computing the exact distance between a degree 2 Bernstein-Bezier triangular surface and its base triangle. Also, this paper gives estimates of maximal distance between a degree 2 or 3 rational Bernstein-Bezier triangular surface and its base triangle with a high precision. These results are easy for programming, simple for computing, and effective for improving the subdivision/triangulation algorithms of common rational Bezier surfaces in a design system.

[1]  Wang Guo-jin,et al.  Improvement of the termination criterion for subdivision of the rational Bézier curves , 2003 .

[2]  Ulrich Reif.  Best bounds on the approximation of polynomials and splines by their control structure , 2000, Comput. Aided Geom. Des..

[3]  Yunfeng Zhang,et al.  Cloud data modelling employing a unified, non-redundant triangular mesh , 2001, Comput. Aided Des..

[4]  Robert P. Markot,et al.  Surface algorithms using bounds on derivatives , 1986, Comput. Aided Geom. Des..

[5]  T. Sederberg,et al.  Comparison of three curve intersection algorithms , 1986 .

[6]  Bernd E. Hirsch,et al.  Triangulation of trimmed surfaces in parametric space , 1992, Comput. Aided Des..

[7]  Richard F. Riesenfeld,et al.  A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Pere Brunet,et al.  Directional adaptive surface triangulation , 1999, Comput. Aided Geom. Des..

[9]  Zhang Ren.  Improvement of the Termination Criterion for Subdivision of the Rational Bézier Curves , 2003 .

[10]  Renjiang Zhang,et al.  Sharp bounds on the approximation of a Bézier polynomial by its quasi-control polygon , 2006, Comput. Aided Geom. Des..

[11]  Jörg Peters,et al.  Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon , 1999, Comput. Aided Geom. Des..

[12]  Wei Xu,et al.  The termination criterion for subdivision of the rational Bézier curves , 1991, CVGIP Graph. Model. Image Process..