Optimal multi-degree reduction of Bézier curves with G2-continuity

In this paper we present a novel approach to consider the multi-degree reduction of Bezier curves with G^2-continuity in L"2-norm. The optimal approximation is obtained by minimizing the objective function based on the L"2-error between the two curves. In contrast to traditional methods, which typically consider the components of the curve separately, we use geometric information on the curve to generate the degree reduction. So positions, tangents and curvatures are preserved at the two endpoints. For avoiding the singularities at the endpoints, regularization terms are added to the objective function. Finally, numerical examples demonstrate the effectiveness of our algorithms.

[1]  K. Höllig,et al.  Geometric Hermite interpolation , 1995 .

[2]  Gerald Farin,et al.  Curves and surfaces for cagd , 1992 .

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

[4]  Wendelin L. F. Degen.  Geometric Hermite Interpolation - : In memoriam Josef Hoschek , 2005, Comput. Aided Geom. Des..

[5]  A. J. Worsey,et al.  Degree reduction of Be´zier curves , 1988 .

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

[7]  Joab R Winkler,et al.  Numerical recipes in C: The art of scientific computing, second edition , 1993 .

[8]  Malcolm A. Sabin,et al.  High accuracy geometric Hermite interpolation , 1987, Comput. Aided Geom. Des..

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

[10]  Shi-Min Hu,et al.  Approximate merging of a pair of Bézier curves , 2001, Comput. Aided Des..

[11]  Daniel Cohen-Or,et al.  Bilateral mesh denoising , 2003 .

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

[13]  G. Farin.  Algorithms for rational Bézier curves , 1983 .

[14]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

[15]  Rene F. Swarttouw,et al.  Orthogonal polynomials , 2020, NIST Handbook of Mathematical Functions.

[16]  Helmut Pottmann,et al.  Approximation with active B-spline curves and surfaces , 2002, 10th Pacific Conference on Computer Graphics and Applications, 2002. Proceedings..

[17]  A. Robin Forrest,et al.  Interactive interpolation and approximation by Bezier polynomials , 1972, Comput. J..

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

[19]  Fujio Yamaguchi,et al.  Computer-Aided Geometric Design , 2002, Springer Japan.

[20]  孙家广,et al.  Approximate Degree Reduction of Bezier Curves , 1998 .

[21]  Matthias Eck,et al.  Degree reduction of Bézier curves , 1993, Comput. Aided Geom. Des..

[22]  Guozhao Wang,et al.  Perturbing B ezier coefficients for best constrained degree reduction in the L 2-norm , 2003 .

[23]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .