APPROXIMATION OF INTERVAL BEZIER SURFACES

Based on the conception of perturbation, an approach to the interval Bezier surfaces approximating ra- tional surfaces is presented using the energy minimization method. The method places more restrictions on the perturbation surfaces than the original surfaces. The applications of the approach are also presented. Experimen- tal result is combined with the subdivision method to obtain a piecewise interval polynomial approximation for a rational surface.

BOUNDING PYRAMIDS AND BOUNDING CONES FOR TRIANGULAR BEZIER SURFACES

This paper describes practical approaches on how to construct bounding pyramids and bounding cones for triangular Bezier surfaces. Examples are provided to illustrate the process of construction and comparison is made between various surface bounding volumes. Furthermore, as a starting point for the construction, we provide a way to compute hodographs of triangular Bezier surfaces and improve the algorithm for computing the bounding cone of a set of vectors. [ABSTRACT FROM AUTHOR]

RAY TRACING BEZIER SURFACE

A new algorithm for ray tracing bicubic Bezier surface intersection is presented. In order to find the intersected patches more effectively, a quadtree representation for surface patches is utilized. The introduction of the alternative binary tree subdivision of Bezier surface effectively improves the performance of the ray surface intersection, with the benefit of avoiding the problem that the binary tree subdivision would produce long narrow patches and speeding the intersection finding process. The algorithm has been programmed in FORTRAN-77 and on prime-550 II computer. The result shows that its structure is simple and it is easy to implement with good performance.

Judging or setting weight steady-state of rational Bézier curves and surfaces

Many works have investigated the problem of reparameterizing rational B^zier curves or surfaces via MSbius transformation to adjust their parametric distribution as well as weights, such that the maximal ratio of weights becomes smallerthat some algebraic and computational properties of the curves or surfaces can be improved in a way. However, it is an indication of veracity and optimization of the reparameterization to do prior to judge whether the maximal ratio of weights reaches minimum, and verify the new weights after MSbius transfor- mation. What＇s more the users of computer aided design softwares may require some guidelines for designing rational B6zier curves or surfaces with the smallest ratio of weights. In this paper we present the necessary and sufficient conditions that the maximal ratio of weights of the curves or surfaces reaches minimum and also describe it by using weights succinctly and straightway. The weights being satisfied these conditions are called being in the stable state. Applying such conditions, any giving rational B6zier curve or surface can automatically be adjusted to come into the stable state by CAD system, that is, the curve or surface possesses its optimal para- metric distribution. Finally, we give some numerical examples for demonstrating our results in important applications of judging the stable state of weights of the curves or surfaces and designing rational B6zier surfaces with compact derivative bounds.

Constrained multi-degree reduction of triangular Bézier surfaces

This paper proposes and applies a method to sort two-dimensional control points of triangular Bezier surfaces in a row vector. Using the property of bivariate Jacobi basis functions, it further presents two algorithms for multi-degree reduction of triangular Bezier surfaces with constraints, providing explicit degree-reduced surfaces. The first algorithm can obtain the explicit representation of the optimal degree-reduced surfaces and the approximating error in both boundary curve constraints and corner constraints. But it has to solve the inversion of a matrix whose degree is related with the original surface. The second algorithm entails no matrix inversion to bring about computational instability, gives stable degree-reduced surfaces quickly, and presents the error bound. In the end, the paper proves the efficiency of the two algorithms through examples and error analysis.

Shape Control and Modification of Rational Bezier Curve and Surface

A Bezier interpolation approach is proposed which uses local generation of endpoint slopes and forces the curve and the surface to pass through an arbitrarily specified point to control and modify the shape of curve and surface, making the result satisfactory.

Interval Bézier Surfaces Approximation of Rational Surfaces

On the basis of the perturbation, we present an approach to approximating rational surfaces by the interval Btzier surfaces using energy minimization method. The approach makes the perturbation surfaces have more restrictions than the original surfaces. It could be combined with subdivision method to obtain a piecewise interval polynomial approximation for a rational surface. The applications of this approach are illustrated too.

G^1 Continuity Conditions of B-spline Surfaces

According to the B-spline theory and Boehm algorithm, this paper presents several necessary and sufficient G1 continuity conditions between two adjacent B-spline surfaces. In order to meet the need of application, a kind of sufficient conditions of G1 continuity are developed, and a kind of sufficient conditions of G1 continuity among N(N>2) patch B-spline surfaces meeting at a common corner are given at the end.

An Arbitrary Triangular Bezier Sudivision Slgorithm and its Applications

in this paper, a theorem on an arbitrary subdivision algorithm for Bernstein-BezierTriangles is preeented. It can be used in various kinds of subdivision for Bezier triangles. Severalexamples including the centric point subdivision algorithm and the centric edge subdivisionalgorithm are presented.

Approximate Degree Reduction of Triangular Bezier Surfaces

Degree reduction of parametric curves and surfaces is an important process in the exchange of product model data between various CAD systems. In this paper the degenerate conditions of triangular Bezier surface patches are derived. The degenerate conditions and constrained optimization methods are used to develop a degree reduction method for triangular Bezier surface patches. The error in the degree reduction of a triangular Bezier surface is also shown to depend on some geometric invariants which decrease exponentially in the subdivision process. Therefore, the degree reduction method can be combined with a subdivision algorithm to generate lower degree approximations which are within some preset error tolerance.

Degenerations of rational Bézier surface with weights in the form of exponential function

Rational Bezier surface is a widely used surface fitting tool in CAD. When all the weights of a rational B@zier surface go to infinity in the form of power function, the limit of surface is the regular control surface induced by some lifting function, which is called toric degenerations of rational Bezier surfaces. In this paper, we study on the degenerations of the rational Bezier surface with weights in the exponential function and indicate the difference of our result and the work of Garcia-Puente et al. Through the transformation of weights in the form of exponential function and power function, the regular control surface of rational Bezier surface with weights in the exponential function is defined, which is just the limit of the surface. Compared with the power function, the exponential function approaches infinity faster, which leads to surface with the weights in the form of exponential function degenerates faster.

A novel algorithm for explicit optimal multi-degree reduction of triangular surfaces

This paper introduces the algebraic property of bivariate orthonormal Jacobi polynomials into geometric approximation. Based on the latest results on the transformation formulae between bivariate Bernstein polynomials and Jacobi polynomials, we naturally deduce a novel algorithm for multi-degree reduction of triangular B^zier surfaces. This algorithm possesses four characteristics： ability of error forecast, explicit expression, less time consumption, and best precision. That is, firstly, whether there exists a multi-degree reduced surface within a prescribed tolerance is judged beforehand; secondly, all the operations of multi-degree reduction are just to multiply the column vector generated by sorting the series of the control points of the original surface in lexicographic order by a matrix; thirdly, this matrix can be computed at one time and stored in an array before processing degree reduction; fourthly, the multi-degree reduced surface achieves an optimal approximation in the norm L2. Some numerical experiments are presented to validate the effectiveness of this algorithm, and to show that the algorithm is applicable to information processing of products in CAD system.

Ray-triangular Bezier patch intersection using hybrid clipping algorithm

In this paper, we present a novel geometric method for efficiently and robustly computing intersections between a ray and a triangular Bezier patch defined over a triangular domain, called the hybrid clipping （HC） algorithm. If the ray pierces the patch only once, we locate the parametric value of the intersection to a smaller triangular domain, which is determined by pairs of lines and quadratic curves, by using a multi-degree reduction method. The triangular domain is iteratively clipped into a smaller one by combining a subdivision method, until the domain size reaches a prespecified threshold. When the ray intersects the patch more than once, Descartes＇ rule of signs and a split step are required to isolate the intersection points. The algorithm can be proven to clip the triangular domain with a cubic convergence rate after an appropriate preprocessing procedure. The proposed algorithm has many attractive properties, such as the absence of an initial guess and insensitivity to small changes in coefficients of the original problem. Experiments have been conducted to illustrate the efficacy of our method in solving ray-triangular Bezier patch intersection problems.