Efficient Algorithm for B-Spline Curve Fitting by Using Feature Data Points

Article Preview

Abstract:

In order to obtain B-spline curve with fewer control points and higher precision, an efficient algorithm for B-spline curve fitting by using feature data points is proposed. During iterations of the proposed algorithm, the projected points, which are the nearest points on fitting curve to discrete data points, are calculated first, then maximal deviations between B-spline curve and connection lines of the data points are controlled, finally new feature points are determined and parameters of feature points are adjusted by parameters of projected points. According to these, B-spline curve with fewer control points and higher precision are obtained rapidly. Experimental result indicates that the proposed algorithm is feasible and effective.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

523-526

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Weishi Li, Shuhong Xu , Gang Zhao, et. al: Computer Aided Design Vol. 37(2005), pp.791-797.

Google Scholar

[2] Sarkar B, Menq C H: Computer Aided Geometric Design Vol. 8(1991), pp.267-290.

Google Scholar

[3] Zhao Jibin, Liu Weijun, Wang Yuechao, et. al: Mini-Micor Systems Vol. 26(2005), pp.496-499 . In Chinese.

Google Scholar

[4] Ye Peiqing, Chen Kaiyun, Zhang Hui, et. al: Systems engineering and electronics Vol. 27(2005), pp.1617-1619 . In Chinese.

Google Scholar

[5] Park H, Lee J H: Computer-Aided Design Vol. 39(2007), pp.439-451. In Chinese.

Google Scholar

[6] Chen Xiaobing, Liao Wenhe: Journal of Computer-Aided Design & Computer Graphics Vol. 22(2010), pp.1587-1592. In Chinese.

Google Scholar

[7] Fazhong Shi: CAGD & NURBS, Higher Education Press(2001).

Google Scholar