计算机校报制作,计算机学报

Abstract &

BackgroundAbstract This paper generalizes American computer graphics expert T. Sederberg’s idea and algorithm of the Hybrid method, approximating rational Bézier curves with polynomial forms, to the case of rational surfaces defined in the triangular domain, which is adopted widely in engineering. The main work in this paper includes the following aspects: Giving a rational triangular B-B surface; representing each control point of a polynomial triangular B-B surface by a rational triangular B-B surface of the same degree, i.e., regarding each control point of the polynomial surface as a moving point on a rational triangular B-B surface with some constraints, the equivalent Hybrid surface defined in the triangular domain is constructed. With the help of the appropriate construction of Hybrid surface of degree 1 for the given rational triangular B-B surface, a recursive formula is derived for the control points between two Hybrid surfaces that are equivalent with each other but have adjacent degree. Additionally, by fixing a point in the convex hull of each moving control points of the Hybrid surface as the corresponding control points of the Hybrid polynomial B-B surface, an effective algorithm is obtained to approximate rational triangular B-B surfaces by using the corresponding polynomial forms. As an example, a numerical application is presented in this paper. All the results above can improve the feasibility of data exchange and efficiency of computation evidently in computer aided geometric design system.

keywords computer aided geometric design; Hybrid surface; polynomial triangular Bernstein-Bézier surface; rational triangular Bernstein-Bézier surface; polynomial approximation

background Approximating surfaces of rational forms by polynomials is a significant problem in Computer Aided Geometric Design and graphics systems design, which aims at converting complex rational polynomial surface to polynomial ones within an acceptable tolerance. Using the approximation, complex calculation of rational forms can be approximated by the calculation of polynomials; curves and surface design systems can do data exchanges for their different representation of curves and surfaces using polynomials or rational polynomials.

The polynomial approximation for curves of rational forms has been studied widely, some of which were applied to approximation of the rational polynomial surfaces defined in the rectangle domain successfully. Rational triangular Bernstein-Bézier surface is also an important modeling tool in many systems, because it offers certain advantages over rational Bézier surface defined in the rectangle domain. However, there is lack of sufficient research about this approximation problem of rational triangular Bernstein-Bézier surface, which is still a remaining and challenging problem in this field.

The authors have done much relative research work on this problem.

In view of important role of rational triangular Bernstein-Bézier surface in geometric design, but lack of sufficient research about the corresponding polynomials approximation and approximation error estimation at present, this paper tries to solve it.

Considering T. Sederberg’s Hybrid method, approximating rational Bézier curves with polynomials, the authors generalize this method to the rational triangular surface. Concretely, the authors construct the Hybrid surface for a given rational triangular Bernstein-Bézier surface and the recursive formula of control points between two Hybrid surfaces of the adjacent degree. Based on these work, the authors present the expected algorithm of approximating a rational triangular Bernstein-Bézier surface with a triangular Bernstein-Bézier surface of polynomial forms, and an error estimation of the approximation is also derived. As an example, the authors use the polynomial triangular B-B surface of degree 3 to approximate the octant sphere represented by rational triangular B-B surface. The results in this paper can give a better performance in the feasibility of data exchange and efficiency of computation in computer aided geometric design system.