Hostname: page-component-5c6d5d7d68-wtssw Total loading time: 0 Render date: 2024-08-16T15:41:13.406Z Has data issue: false hasContentIssue false
  • English
  • Français

Distance for Bézier curves and degree reduction

Published online by Cambridge University Press:  17 April 2009

Byung-Gook Lee  and
Yunbeom Park
Byung-Gook Lee
Affiliation:
Department of Applied MathematicsDongseo UniversityPusan, 617–716Korea
Yunbeom Park
Affiliation:
Department of Mathematics EducationSeowon UniversityChongju, 361–742Korea
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.

An algorithmic approach to degree reduction of Bézier curves is presented. The algorithm is based on the matrix representations of the degree elevation and degree reduction processes. The control points of the approximation are obtained by the generalised least squares method. The computations are carried out by minimising the L2 and discrete l2 distance between the two curves.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 56 , Issue 3 , December 1997 , pp. 507 - 515
Copyright
Copyright © Australian Mathematical Society 1997

References

[1]Bézier, P., Numerical control, mathematics and applications (Wiley, New York, 1972).Google Scholar
[2]de Casteljau, P., Outillage méthodes calcul (André Citroën Automobiles SA, Paris, 1959).Google Scholar
[3]Dannenberg, L. and Nowacki, H., ‘Approximate conversion of surface representations with polynomial bases’, Comput. Aided Geom. Design 2 (1985), 123–131.Google Scholar
[4]Degen, W.L.F., ‘Best approximation of parametric curve by splines’, in Mathematical methods in computer aided design II, (Lyche, T. and Schumaker, L.L., Editors) (Academic Press, New York, 1992).Google Scholar
[5]Dugundji, J., Topology (Allyn and Bacon, Boston, 1966).Google Scholar
[6]Eck, M., ‘Degree reduction of Bézier curves’, Comput. Aided Geom. Design 10 (1993), 237–251.Google Scholar
[7]Eck, M., ‘Least squares degree reduction of Bézier curves’, Comput. Aided Geom. Design 27 (1995), 845–851.CrossRefGoogle Scholar
[8]Emery, J.D., ‘The definition and computation of a metric on plane curves’, Comput. Aided Geom. Design 18 (1986), 25–28.Google Scholar
[9]Farin, G., ‘Algorithms for rational Bézier curves’, Comput. Aided Geom. Design 15 (1983), 73–77.CrossRefGoogle Scholar
[10]Farin, G., Curves and surfaces for computer aided geometric design (Academic Press, New York, 1988).Google Scholar
[11]Forrest, A.R., ‘Interactive interpolation and approximation by Bézier polynomials’, Comput. Aided Geom. Design 22 (1990), 527–537.CrossRefGoogle Scholar
[12]Gonin, R. and Money, A.H., Nonlinear Lp-norm estimation (Marcel Dekker, Inc., New York, 1989).Google Scholar
[13]Golub, G.H. and Van Loan, C.F., Matrix computations (Johns Hopkins Univ. Press, Maryland, 1983).Google Scholar
[14]Hoscheck, J., ‘Approximate conversion of spline curves’, Comput. Aided Geom. Design 4 (1987), 59–66.Google Scholar
[15]Lachance, M.A., ‘Chebyshev economization for parametric surfaces’, Comput. Aided Geom. Design 5 (1988), 195–208.CrossRefGoogle Scholar
[16]Strang, G., Linear algebra and its applications, (second edition) (Academic Press, New York, 1980).Google Scholar
[17]Watkins, M.A. and Worsey, J.A., ‘Degree reduction of Bézier curves’, Comput. Aided Geom. Design 20 (1988), 398–405.Google Scholar
[18]Park, Y. and Choi, U.J., ‘The error analysis for degree reduction of Bézier curves’, Comput. Math. Appl. 27 (1994).Google Scholar
[19]Park, Y., Choi, U.J. and Kimn, H.J., ‘Approximate conversion of Bézier curves’, Bull. Austral. Math. Soc. 51 (1995), 153–162.Google Scholar