Optimal multi-degree reduction of Bézier curves with geometric constraints

In this paper we present a novel algorithm for the multi-degree reduction of Bezier curves with geometric constraints. Based on the given constraints, we construct an objective function which is abstracted from the approximation error in L"2-norm. Two types of geometric constraints are tackled. With the constraints of G^2-continuity at one endpoint and G^1-continuity (or C^r-continuity) at the other endpoint, we derive the optimal degree-reduced curves in explicit form. With the constraints of G^2-continuity at two endpoints, the problem of degree reduction is equivalent to minimizing a bivariate polynomial function of degree 4. Compared with the traditional methods, we derive the optimal degree-reduced curves more effectively. Finally, evaluation results demonstrate the effectiveness of our method.

[1]  Ligang Liu,et al.  Fast approach for computing roots of polynomials using cubic clipping , 2009, Comput. Aided Geom. Des..

[2]  Guozhao Wang,et al.  Perturbing Bézier coefficients for best constrained degree reduction in the L2-norm , 2003, Graph. Model..

[3]  Wang Guo-jin,et al.  Constrained Bézier curves' best multi-degree reduction in the L2-norm , 2005 .

[4]  W. Boehm,et al.  Bezier and B-Spline Techniques , 2002 .

[5]  Matthias Eck,et al.  Least squares degree reduction of Bézier curves , 1995, Comput. Aided Des..

[6]  Pawel Wozny,et al.  Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials , 2009, Comput. Aided Geom. Des..

[7]  Jean-Claude Paul,et al.  Multi-degree reduction of Bézier curves using reparameterization , 2011, Comput. Aided Des..

[8]  Jörg Peters,et al.  Polynomial degree reduction in the L2-norm equals best Euclidean approximation of Bézier coefficients , 1999, Comput. Aided Geom. Des..

[9]  Lian Zhou,et al.  Matrix Representation for Optimal Multi-degree Reduction of Bézier Curves with G 1 Constraints: Matrix Representation for Optimal Multi-degree Reduction of Bézier Curves with G 1 Constraints , 2010 .

[10]  Abedallah Rababah,et al.  A simple matrix form for degree reduction of Bézier curves using Chebyshev-Bernstein basis transformations , 2006, Appl. Math. Comput..

[11]  Hasik Sunwoo,et al.  Matrix representation for multi-degree reduction of Be'zier curves , 2005, Comput. Aided Geom. Des..

[12]  Stephen Mann,et al.  Linear methods for G1, G2, and G3 - Multi-degree reduction of Bézier curves , 2013, Comput. Aided Des..

[13]  Young Joon Ahn,et al.  Constrained polynomial degree reduction in the L2-norm equals best weighted Euclidean approximation of Bézier coefficients , 2004, Comput. Aided Geom. Des..

[14]  Guozhao Wang,et al.  Optimal multi-degree reduction of Bézier curves with G2-continuity , 2006, Comput. Aided Geom. Des..

[15]  Lian Zhou,et al.  Optimal constrained multi-degree reduction of Bézier curves with explicit expressions based on divide and conquer , 2009 .

[16]  Josef Hoschek.  Approximate conversion of spline curves , 1987, Comput. Aided Geom. Des..

[17]  Stephen Mann,et al.  Iterative process for G2-multi degree reduction of Bézier curves , 2011, Appl. Math. Comput..

[18]  G. Farin.  Curves and Surfaces for Cagd: A Practical Guide , 2001 .