Smooth B-Spline Curves Extension with Ordered Points Constraint

Abstract:

Article Preview

An algorithm for extending B-spline curves with a sequence of ordered points constraint is presented based on the curve unclamping algorithm. The ordered points are divided into two categories: interpolation points and approximation points. The number of interpolation points increases gradually during the curve extension process. The most important feature of this algorithm is the ability to optimize the knots of the extended curve segment according to the ordered points. Thus, with minimum number of interpolation points, the maximum deviation of the extended curve segment from the ordered points is less than the given tolerance. The extended curve segment connects to the original curve with maximum continuity intrinsically. Several experimental results have shown the validity and applicability of the proposed algorithm.

Info:

Periodical:

Advanced Materials Research (Volumes 311-313)

Edited by:

Zhongning Guo

Pages:

1439-1445

DOI:

10.4028/www.scientific.net/AMR.311-313.1439

Citation:

J. Xu "Smooth B-Spline Curves Extension with Ordered Points Constraint", Advanced Materials Research, Vols. 311-313, pp. 1439-1445, 2011

Online since:

August 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.