A simple, efficient degree raising algorithm for B-spline curves

Computer Aided Geometric Design

Volumn 14, Issue 7, 1997, Pages 693-698

  Liu, Wayne ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Algorithm; B splines; Blossoming; Degree elevation; Splines

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS;

DEGREE RAISED SPLINE; KNOT DELETION; KNOT INSERTION;

ALGORITHMS;

EID: 0031233486     PISSN: 01678396     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8396(96)00060-X     Document Type: Article

References (8)

1. Boehm, W. (1980), Inserting new knots into B-spline curves, Computer-Aided Design 12, 199-201.
2. Cohen, E., Lyche, T. and Schumaker, L. (1985), Algorithms for degree raising of splines, ACM Transactions on Graphics 4, 171-181.
3. Mann, S. and Liu, W. (1995), An analysis of polynomial composition algorithms, Technical Report CS-95-24, University of Waterloo, Waterloo, Ontario, N2L 3G1 Canada.
4. Prautzsch, H. and Piper, B. (1991), A fast algorithm to raise the degree of B-spline curves, Computer Aided Geometric Design 8, 253-266.
5. Prautzsch, H. (1984), Degree elevation of B-spline curves, Computer Aided Geometric Design 18, 193-198.
6. Piegl, L. and Tiller, W. (1994), Software-engineering approach to degree elevation of B-spline curves, Computer-Aided Design 26, 17-28.
7. Ramshaw, L. (1987), Blossoming: A connect-the-dots approach to splines, Technical Report 19, Digital Equipment Corporation, Systems Research Centre.
8. Seidel, H. (1989), Computing B-spline control points, in: Strasser, W. and Seidel, H., eds., Theory and Practice of Geometric Modeling, Springer, Berlin, 17-32.