论文信息 - Degree reduction of Be´zier curves

Degree reduction of Be´zier curves

Abstract An algorithm for generating an ( n − 1 )st degree approximation to an nth degree Bezier curve is presented. The method is based on minimax approximation techniques which allow the development of a detailed error analysis. By combining subdivision with the degree reduction algorithm, a piecewise defined approximation can be generated, which is within some preset error tolerance of the original curve. The number of subdivisions required can be determined a priori and by iterating the scheme, a piecewise degree d approximation can be generated.

A. J. Worsey | A. Worsey | M. A. Watkins | M. Watkins

[1] Gerald E. Farin,et al. Fairing cubic B-spline curves , 1987, Comput. Aided Geom. Des..

[2] E. Cheney. Introduction to approximation theory , 1966 .

[3] Horst Nowacki,et al. Approximate conversion of surface representations with polynomial bases , 1985, Comput. Aided Geom. Des..

[4] Donald Ervin Knuth,et al. The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[5] Rida T. Farouki,et al. Algorithms for polynomials in Bernstein form , 1988, Comput. Aided Geom. Des..

[6] Josef Hoschek. Approximate conversion of spline curves , 1987, Comput. Aided Geom. Des..

[7] Gerald Farin,et al. Triangular Bernstein-Bézier patches , 1986, Comput. Aided Geom. Des..

[8] Wolfgang Böhm,et al. A survey of curve and surface methods in CAGD , 1984, Comput. Aided Geom. Des..

[9] Carl S. Petersen. Adaptive contouring of three-dimensional surfaces , 1984, Comput. Aided Geom. Des..

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

[11] Rida T. Farouki,et al. On the numerical condition of polynomials in Bernstein form , 1987, Comput. Aided Geom. Des..

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

[13] T. Sederberg,et al. Comparison of three curve intersection algorithms , 1986 .