Constrained multi-degree reduction of rational Bézier curves using reparameterization

Applying homogeneous coordinates, we extend a newly appeared algorithm of best constrained multi-degree reduc- tion for polynomial Bézier curves to the algorithms of constrained multi-degree reduction for rational Bézier curves. The idea is introducing two criteria, variance criterion and ratio criterion, for reparameterization of rational Bézier curves, which are used to make uniform the weights of the rational Bézier curves as accordant as possible, and then do multi-degree reduction for each component in homogeneous coordinates. Compared with the two traditional algorithms of "cancelling the best linear common divisor" and "shifted Chebyshev polynomial", the two new algorithms presented here using reparameterization have advantages of simplicity and fast computing, being able to preserve high degrees continuity at the end points of the curves, do multi-degree reduction at one time, and have good approximating effect.     

A quadratic programming method for optimal degree reduction of Bezier curves with G^1-continuity

This paper presents a quadratic programming method for optimal multi-degree reduction of Bézier curves with G1-continuity. The L2 and l2 measures of distances between the two curves are used as the objective functions. The two additional parameters, available from the coincidence of the oriented tangents, are constrained to be positive so as to satisfy the solvability condition. Finally, degree reduction is changed to solve a quadratic problem of two parameters with linear constraints. Applica     

Constrained multi-degree reduction of rational Bézier curves using reparameterization

Applying homogeneous coordinates, we extend a newly appeared algorithm of best constrained multi-degree reduccomponent in homogeneous coordinates. Compared with the two traditional algorithms of "cancelling the best linear common divisor" and "shifted Chebyshev polynomial", the two new algorithms presented here using reparameterization have advantages of simplicity and fast computing, being able to preserve high degrees continuity at the end points of the curves, do multi-degree reduction at one time, and have good approximating effect.     

Rational offset approximation of rational Bézier curves

The problem of parametric speed approximation of a rational curve is raised in this paper. Offset curves are widely used in various applications. As for the reason that in most cases the offset curves do not preserve the same polynomial or rational polynomial representations, it arouses difficulty in applications. Thus approximation methods have been introduced to solve this problem. In this paper, it has been pointed out that the crux of offset curve approximation lies in the approximation of parametric speed. Based on the Jacobi polynomial approximation theory with endpoints interpolation, an algebraic rational approximation algorithm of offset curve, which preserves the direction of normal, is presented. Project supported by the National Basic Research Program (973) of China (No. 2002CB312101) and the National Natural Science Foundation of China (Nos. 60373033 and 60333010)     

Bézier curves with shape parameter

In this paper, Bezier basis with shape parameter is constructed by an integral approach. Based on this basis, we define the Bezier curves with shape parameter. The Bezier basis curves with shape parameter have most properties of Bemstein basis and the Bezier curves. Moreover the shape parameter can adjust the curves' shape with the same control polygon. As the increase of the shape parameter, the Bezier curves with shape parameter approximate to the control polygon. In the last, the Bezier surface with shape parameter is also constructed and it has most properties of Bezier surface.     

A new fractional rational Bézier curve

Based on rational Bézier curves given by Ron Goldman, a new fractional rational Bézier curve was first defined in terms of fractional Bernstein bases. Moreover, some basic properties were dicussed and a theorem connected to Poisson curves was obtained. Some examples in this paper were given by the visual results. Project supported by the National Natural Science Foundation of China (Grant No. 10271074)     

Shape modification of Bézier curves by constrained optimization

The Bézier curve is one of the most commonly used parametric curves in CAGD and Computer Graphics and has many portant problem, and is also an important research issue in CAD/CAM and NC technology fields. This work investigates the curves to satisfy the given constraints and modify the shape of the curves optimally. Practical examples are also given.     

Visible region extraction from a sequence of rational Bézier surfaces

A method for computing the visible regions of free-form surfaces is proposed in this paper. Our work is focused on accurately calculating the visible regions of the sequenced rational Bézier surfaces forming a solid model and having coincident edges but no inner-intersection among them. The proposed method calculates the silhouettes of the surfaces without tessellating them into triangle meshes commonly used in previous methods so that arbitrary precision can be obtained. The computed silhouettes of visible surfaces are projected onto a plane orthogonal to the parallel light. Then their spatial relationship is applied to calculate the boundaries of mutual-occlusion regions. As the connectivity of the surfaces on the solid model is taken into account, a surface clustering technique is also employed and the mutual-occlusion calculation is accelerated. Experimental results showed that our method is efficient and robust, and can also handle complex shapes with arbitrary precision. Project supported by the National Basic Research Program (973) of China (No. 2002CB312106) and the National Natural Science Foundation of China (Nos. 60533070, and 60403047). The third author was supported by the project sponsored by a Foundation for the Author of National Excellent Doctoral Dissertation of China (No. 200342) and a Program for New Century Excellent Talents in University (No. NCET-04-0088), China     

A quadratic programming method for optimal degree reduction of Bézier curves with G1-conitnuity

This paper presents a quadratic programming method for optimal multi-degree reduction of Bézier curves with G1-continuity. The L2 and l2 measures of distances between the two curves are used as the objective functions. The two additional parameters, available from the coincidence of the oriented tangents, are constrained to be positive so as to satisfy the solvability condition. Finally, degree reduction is changed to solve a quadratic problem of two parameters with linear constraints. Applica     

Improvement of the termination criterion for subdivision of the rational Bézier curves

By using some elementary inequalities, authors in this paper makes further improvement for estimating the heights of Bézier curve and rational Bézier curve. And the termination criterion for subdivision of the rational Bézier curve is also improved. The conclusion of the extreme value problem is thus further confirmed.