Similar articles

Abstract: We decompose the problem of the optimal multi-degree reduction of bé;zier curves with corners constraint into two simpler subproblems, namely making high order interpolations at the two endpoints without degree reduction, and doing optimal degree reduction without making high order interpolations at the two endpoints. Further, we convert the second subproblem into multi-degree reduction of Jacobi polynomials. Then, we can easily derive the optimal solution using orthonormality of Jacobi polynomials and the least square method of unequally accurate measurement. This method of ‘divide and conquer’ has several advantages including maintaining high continuity at the two endpoints of the curve, doing multi-degree reduction only once, using explicit approximation expressions, estimating error in advance, low time cost, and high precision. More importantly, it is not only deduced simply and directly, but also can be easily extended to the degree reduction of surfaces. Finally, we present two examples to demonstrate the effectiveness of our algorithm.

[1] Ahn, Y.J., Lee, B.G., Park, Y., Yoo, J., 2004. Constrained polynomial degree reduction in the L₂-norm equals best weighted Euclidean approximation of Bézier coefficients. Computer Aided Geometric Design, 21(2):181-191.

[2] Borwein, P., Erdelyi, T., 1995. Polynomial and Polynomial Inequalities (1st Ed.). Springer-Verlag, Berlin.

[3] Chen, G.D., Wang, G.J., 2002. Optimal multi-degree reduction of Bézier curves with constraints of endpoints continuity. Computer Aided Geometric Design, 19(6):365-377.

[4] Dannenberg, L., Nowacki, H., 1985. Approximate conversion of surface representations with polynomial bases. Computer Aided Geometric Design, 2(1-3):123-132.

[5] Eck, M., 1993. Degree reduction of Bézier curves. Computer Aided Geometric Design, 10(3-4):237-257.

[6] Eck, M., 1995. Least squares degree reduction of Bézier curves. Computer-Aided Design, 27(11):845-851.

[7] Farin, G., 1983. Algorithms for rational Bézier curves. Computer-Aided Design, 15(2):73-77.

[8] Forrest, A.R., 1972. Interactive interpolation and approximation by Bézier polynomials. The Computer Journal, 15(1):71-79.

[9] Hoschek, J., 1987. Approximation of spline curves. Computer Aided Geometric Design, 4(1-2):59-66.

[10] Lachance, M.A., 1988. Chebyshev economization for parametric surfaces. Computer Aided Geometric Design, 5(3):195-208.

[11] Lodha, S., Warren, J., 1994. Degree reduction of Bézier simplexes. Computer-Aided Design, 26(10):735-746.

[12] Moore, D., Warren, J., 1991. Least-squares Approximations to Bézier Curves and Surfaces. In: Arvo, J. (Ed.), Graphics Gems II. Academic Press, New York, p.406-411.

[13] Rababah, A., Lee, B.G., Yoo, J., 2006. A simple matrix form for degree reduction of Bézier curves using Chebyshev-Bernstein basis transformations. Appl. Math. Comput., 181(1):310-318.

[14] Rababah, A., Lee, B.G., Yoo, J., 2007. Multiple degree reduction and elevation of Bézier curves using Jacobi-Bernstein basis transformations. Numer. Funct. Anal. Optim., 28(9-10):1179-1196.

[15] Sunwoo, H., 2005. Matrix representation for multi-degree reduction of Bézier curves. Computer Aided Geometric Design, 22(3):261-273.

[16] Watson, G.A., 1980. Approximation Theory and Numerical Methods. John Wiley & Sons, Chichester.

[17] Zhang, R.J., Wang, G.J., 2005. Constrained Bézier curves’ best multi-degree reduction in the L₂-norm. Progr. Nat. Sci., 15(9):843-850.

[18] Zheng, J.M., Wang, G.Z., 2003. Perturbing Bézier coefficients for best constrained degree reduction in the L₂ norm. Graphical Models, 65(6):351-368.