Abstract
A new identity is proved that represents thekth order B-splines as linear combinations of the (k+1) th order B-splines. A new method for degree-raising of B-spline curves is presented based on the identity. The new method can be used for all kinds of B-spline curves, that is, both uniform and arbitrarily nonuniform B-spline curves. When used for degree-raising of a segment of a uniform B-spline curve of degreek−1, it can help obtain a segment of curve of degreek that is still a uniform B-spline curve without raising the multiplicity of any knot. The method for degree-raising of Bezier curves can be regarded as the special case of the new method presented. Moreover, the conventional theory for degree-raising, whose shortcoming has been found, is discussed.
Similar content being viewed by others
References
Forest, A. R., Interactive interpolation and approximation by Bezier polynomials,Computer J., 1972, 15: 71.
Prautzsch, H., Degree elevation of B-spline curves,CAGD, 1984, 1: 193.
Cohen, E., Lyche, T., Schumaker, L. L., Algorithms for degree-raising of splines,ACM Transactions of Graphics, 1985, 4(3): 171.
Cohen, E., Lyche, T., Schumaker, L. L., Degree raising for splines,Journal of Approximation Theory, 1986, 46: 170.
Prautzsch, H., Piper, B., A fast algorithm to raise the degree of spline curves,CAGD, 1991, 8: 253.
Piegl, L., Tiller, W., Software-engineering approach to degree elevation of B-spline curves,CAD, 1994, 26(1): 17.
Qin, K., A new algorithm for degree-raising of nonuniform B-spline curves,Chinese Journal of Computers, 1996, 19(7): 537.
Woodward, C. D., Skinning techniques for interactive B-spline surface interpolation,CAD, 1988, 20(8): 441.
deBoor, C., On calculating with B-splines,J. Approx. Theory, 1972, 6: 50.
Cox, M. G., The numerical evaluation of B-splines,J. Inst. Math. & Applic., 1972, 10: 134.
Micchelli, C., On a numerically efficient method for computing multivariate B-splines, inMultivariate Approximation Theory (eds. Schempp, W., Zeller, K.), Basel: Birkhäuser, 211–248.
Barry, P. J., Goldman, R. N. A recursive proof of a B-spline identity for degree elevation,CAGD 1988, 5: 173.
Lee, E. T. Y., Remark on an identity related to degree elevation,CAGD, 1994, 11: 109.
Cohen, E., Schumaker, L. L., Rates of convergence of control polygons,Computer Aided Geometric Design, 1985, 2: 229.
Boehm, W., Inserting new knots into B-spline curves,CAD, 1980, 12(4): 199.
Cohen, E., Lyche, T., Riesenfeld, R., Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics,Computer Graphics and Image Processing, 1980, 14: 97.
Schumaker, L.,Spline Functions: Basic Theory, New York: John Wiley & Sons, 1981.
Qin, K., Sun, J., Wang, X., Representing conics using NURBS of degree two,Computer Graphics Forum, 1992, 11(5): 285.
Author information
Authors and Affiliations
Additional information
Project supported by the National Natural Science Foundation of China.
Rights and permissions
About this article
Cite this article
Qin, K. A matrix method for degree-raising of B-spline curves. Sci. China Ser. E-Technol. Sci. 40, 71–81 (1997). https://doi.org/10.1007/BF02916592
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02916592