Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-26T06:05:45.979Z Has data issue: false hasContentIssue false
  • English
  • Français

Degree reduction of Béezier curves using constrained Chebyshev polynomials of the second kind

Published online by Cambridge University Press:  17 February 2009

Young Joon Ahn
Young Joon Ahn
Affiliation:
Department of Mathematics Education, Chosun University, Gwangju 501–759, Korea; e-mail: [email protected].
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper a constrained Chebyshev polynomial of the second kind with C1-continuity is proposed as an error function for degree reduction of Bézier curves with a C1-constraint at both endpoints. A sharp upper bound of the L∞ norm for a constrained Chebyshev polynomial of the second kind with C1-continuity can be obtained explicitly along with its coefficients, while those of the constrained Chebyshev polynomial which provides the best C1-constrained degree reduction are obtained numerically. The representations in closed form for the coefficients and the error bound are very useful to the users of Computer Graphics or CAD/CAM systems. Using the error bound in the closed form, a simple subdivision scheme for C1-constrained degree reduction within a given tolerance is presented. As an illustration, our method is applied to C1-constrained degree reduction of a plane Bézier curve, and the numerical result is compared visually to that of the best degree reduction method.

Type
Research Article
Information
The ANZIAM Journal , Volume 45 , Issue 2 , October 2003 , pp. 195 - 205
Copyright
Copyright © Australian Mathematical Society 2003

References

[1]Ahn, Y. J., “Geometric conic spline approximation in CAGD”, Commun. Korean Math. Soc. 17 (2002) 331–347.CrossRefGoogle Scholar
[2]Bogaki, P., Weinstein, S. E. and Xu, Y., “Degree reduction of Bézier curves by uniform approximation with endpoint interpolation”, Comput. Aided Design 27 (1995) 651–662.CrossRefGoogle Scholar
[3]Brunnett, G., Schreiber, T. and Braun, J., “The geometry of optimal degree reduction of Bézier curves”, Comput. Aided Geom. Design 13 (1996) 773–788.CrossRefGoogle Scholar
[4]Cheney, E. W., Introduction to approximation theory (Chelsea, New York, 1982).Google Scholar
[5]Chihara, T. S., An introduction to orthogonal polynomials (Gordon and Breach, New York, 1978).Google Scholar
[6]Davis, P. J., Interpolation and approximation (Dover, New York, 1975).Google Scholar
[7]Eck, M., “Degree reduction of Bézier curves”, Comput. Aided Geom. Design 10 (1993) 237–251.CrossRefGoogle Scholar
[8]Eck, M., “Least squares degree reduction of Bézier curves”, Comput. Aided Design 27 (1995) 845–852.CrossRefGoogle Scholar
[9]Farin, G.Curves and surfaces for computer aided geometric design (Academic Press, Boston, MA, 1993).Google Scholar
[10]Kim, H. J. and Ahn, Y. J., “Good degree reduction of Bézier curves using constrained Jacobi polynomials”, Comput. Math. Appl. 40 (2000) 1205–1215.CrossRefGoogle Scholar
[11]Kim, H. O., Kim, J. H. and Moon, S. Y., “Degree reduction of Bézier curves and filter banks”, Comput. Math. Appl. 31 (1996) 23–30.CrossRefGoogle Scholar
[12]Kim, H. O. and Moon, S. Y., “Degree reduction of Bézier curves by L 1-approximation with endpoint interpolation”, Comput. Math. Appl. 33 (1997) 67–77.CrossRefGoogle Scholar
[13]Lachance, M. A., “Chebyshev economization for parametric surfaces”, Comput. Aided Geom. Design 5 (1988) 195–208.CrossRefGoogle Scholar
[14]Lachance, M. A., “Approximation by constrained parametric polynomials”, Rocky Mountain J. Math. 21 (1991) 473–488.CrossRefGoogle Scholar
[15]Lorentz, G. G., Approximation functions (Chelsea, New York, 1986).Google Scholar
[16]Lutterkort, D., Peters, J. and Reif, U., “Polynomial degree reduction in the L 2-norm equals best Euclidean approximation of Bézier coefficients”, Comput. Aided Geom. Design 16 (1999) 607–612.CrossRefGoogle Scholar
[17]Park, Y. and Lee, B. G., “Distance for Bézier curves and degree reduction”, Bull. Austral. Math. Soc. 56 (1997) 507–515.Google Scholar
[18]Peters, J. and Reif, U., “Least squares approximation of Bézier coefficients provides best degree reduction in the L 2-norm”, J. Approx. Theory 104 (2000) 90–97.CrossRefGoogle Scholar
[19]Piegl, L. and Tiller, W., “Algorithm for degree reduction of B-spline curves”, Comput. Aided Design 27 (1995) 101–110.CrossRefGoogle Scholar
[20]Szegö, G., Orthogonal polynomials, AMS Coll. Publ. 23 (Amer. Math. Soc., Providence, RI, 1975).Google Scholar
[21]Watkins, M. A. and Worsey, A. J., “Degree reduction of Bézier curves”, Comput. Aided Design 20 (1988) 398–405.CrossRefGoogle Scholar
[22]Watson, G. A., Approximation theory and numerical methods (Wiley, New York, 1980).Google Scholar
[23]Yong, J. H., Hu, S. M., Sun, J. G. and Tan, X. Y., “Degree reduction of B-spline curves”, Comput. Aided Geom. Design 18 (2001) 117–127.CrossRefGoogle Scholar