Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials

We present a novel approach to the problem of multi-degree reduction of Bezier curves with constraints, using the dual constrained Bernstein basis polynomials, associated with the Jacobi scalar product. We give properties of these polynomials, including the explicit orthogonal representations, and the degree elevation formula. We show that the coefficients of the latter formula can be expressed in terms of dual discrete Bernstein polynomials. This result plays a crucial role in the presented algorithm for multi-degree reduction of Bezier curves with constraints. If the input and output curves are of degree n and m, respectively, the complexity of the method is O(nm), which seems to be significantly less than complexity of most known algorithms. Examples are given, showing the effectiveness of the algorithm.

[1]  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..

[2]  Gerald Farin,et al.  Curves and surfaces for computer aided geometric design , 1990 .

[3]  Guodong Chen,et al.  Optimal multi-degree reduction of Bézier curves with constraints of endpoints continuity , 2002, Comput. Aided Geom. Des..

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

[5]  Y. Ahn.  Using Jacobi polynomials for degree reduction of Bezier curves with Ck-constraints , 2003, Comput. Aided Geom. Des..

[6]  Iván Area,et al.  Bernstein bases and hahn—eberlein orthogonal polynomials , 1998 .

[7]  Tom Lyche,et al.  Mathematical methods in computer aided geometric design , 1989 .

[8]  Bert Jüttler,et al.  The dual basis functions for the Bernstein polynomials , 1998, Adv. Comput. Math..

[9]  Paul Sablonnière,et al.  Discrete Bernstein bases and Hahn polynomials , 1993 .

[10]  Paweł Woźny,et al.  Generalized Bernstein Polynomials , 2004 .

[11]  Paul Sablonnière.  Discrete Bézier Curves and Surfaces , 1992 .

[12]  Rida T. Farouki.  Convergent inversion approximations for polynomials in Bernstein form , 1999, Comput. Aided Geom. Des..

[13]  Ren-Jiang Zhang,et al.  A note on the paper in CAGD (2004, 21 (2), 181-191) , 2005, Comput. Aided Geom. Des..

[14]  Guido Brunnett,et al.  The geometry of optimal degree reduction of Bézier curves , 1996, Comput. Aided Geom. Des..

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

[16]  Abedallah Rababah,et al.  Weighted dual functions for Bernstein basis satisfying boundary constraints , 2008, Appl. Math. Comput..

[17]  Byung-Gook Lee,et al.  Application of Legendre-Bernstein basis transformations to degree elevation and degree reduction , 2002, Comput. Aided Geom. Des..

[18]  Pawel Wozny,et al.  Dual generalized Bernstein basis , 2006, J. Approx. Theory.

[19]  Namyong Lee,et al.  A unified matrix representation for degree reduction of Bézier curves , 2004, Comput. Aided Geom. Des..

[20]  Abedallah Rababah,et al.  The weighted dual functionals for the univariate Bernstein basis , 2007, Appl. Math. Comput..

[21]  Z. Ciesielski.  Explicit formula relating the Jacobi, Hahn and Bernstein polynomials , 1987 .

[22]  Rene F. Swarttouw,et al.  The Askey-scheme of hypergeometric orthogonal polynomials and its q-analogue Report Fac , 1996, math/9602214.

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

[24]  Guozhao Wang,et al.  Application of Chebyshev II-Bernstein basis transformations to degree reduction of Bézier curves , 2008 .

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