An algorithmic approach to degree reduction of B-spline curves is presented. The method consists of the following steps: (a) decompose the B-spline curve into Btzier pieces on the fly, (b) degree reduce each Btzier piece, and (c) remove the unnecessary knots. A complete algorithm and precise error
Degree reduction of B-spline curves
β Scribed by Jun-Hai Yong; Shi-Min Hu; Jia-Guang Sun; Xing-Yu Tan
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 112 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0167-8396
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we propose the generalized B divided difference, with which the (k -1)th derivative of B-spline curves of order k can be obtained directly without the need to compute the first (k -2) derivatives as before. Based on the generalized B divided difference, the necessary and sufficient condition for degree-reducible B-spline curves is presented. Algorithms for degree reduction of B-spline curves are proposed using the constrained optimization methods.
π SIMILAR VOLUMES
we consider such sequences of closed B-spline curves the elements of which differ only in their degree; i.e., they share the same control polygon. First, we prove that a sequence obtained in this way converges to the point that represents the arithmetic mean of the common control points (their posit