2013Applied Mechanics and MaterialsOpen access

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

Xiao Bing Chen, Kun Yu

Open full text 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Curve fitting, Data point, B-spline, Algorithm, Mathematics, Feature (linguistics), Spline (mechanical), Control point

Related papers

Back to paper searchBrowse research topicsOriginal source
Efficient Algorithm for B-Spline Curve Fitting by Using Feature Data Points — Research Paper | ScholarLens