2014Applied Mechanics and MaterialsOpen access

An Algorithm for Representing Planar Curves in B-Splines

Zi Zhi Lin, Si Hui Shu

Open full text 0 citations

Abstract

An algorithm for representing planar curves in B-splines is presented in this paper. The representing problem is different from the approximation to data points; planar curve provided more information than data points. To make full use of the information, we propose a three-step representing approach: 1.Sample data points along with their tangent vectors from the planar curve according to the given accuracy. 2. Fit the sampled points by Bezier segments using local interpolation; compose these segments to an interpolation curve. 3. Approximate the interpolation curve using the best least approximation to get the final B-spline curve. Tangent information is used in the second step to construct the interpolation curve. In the third step, the system is always positive because of using the best least square approximation, so we can get more freedoms to approximate the interpolation curve. Finally, some examples of this algorithm demonstrate its usefulness and quality.

About this research paper

What this paper is about

An algorithm for representing planar curves in B-splines is presented in this paper. The representing problem is different from the approximation to data points; planar curve provided more information than data points. To make full use of the information, we propose a three-step representing approach: 1.Sample data points along with their tangent vectors from the planar curve according to the given accuracy. 2. Fit the sampled points by Bezier segments using local interpolation; compose these segments to an interpolation curve. 3. Approximate the interpolation curve using the best least approximation to get the final B-spline curve. Tangent information is used in the second step to construct the interpolation curve. In the third step, the system is always positive because of using the best least square approximation, so we can get more freedoms to approximate the interpolation curve. Finally, some examples of this algorithm demonstrate its usefulness and quality.

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

An algorithm for representing planar curves in B-splines is presented in this paper. The representing problem is different from the approximation to data points; planar curve provided more information than data points. To make full use of the information, we propose a three-step representing approach: 1.Sample data points along with their tangent vectors from the planar curve according to the given accuracy. 2. Fit the sampled points by Bezier segments using local interpolation; compose these segments to an interpolation curve. 3. Approximate the interpolation curve using the best least approximation to get the final B-spline curve. Tangent information is used in the second step to construct the interpolation curve. In the third step, the system is always positive because of using the best least square approximation, so we can get more freedoms to approximate the interpolation curve. Finally, some examples of this algorithm demonstrate its usefulness and quality.

Key concepts: Interpolation (computer graphics), Bézier curve, Mathematics, Tangent, Data point, Curve fitting, Algorithm, Planar

Related papers

Back to paper searchBrowse research topicsOriginal source
An Algorithm for Representing Planar Curves in B-Splines — Research Paper | ScholarLens