2015Unpublished venueRequires access

A fast non-uniform knots placement method for B-spline fitting

Tegoeh Tjahjowidodo, VT. Dung, ML. Han

Open publisher page 19 citations

Abstract

A two-step fast non-uniform knot placement algorithm applicable for noisy data is presented in this paper. The algorithm is started by evaluating the second derivative of the sampled data and, subsequently, by using the half-split approach, the best piecewise linear function is fitted to the computed derivative. In the second step, the fitted functions are adjusted to define the final knot for the B-spline fitting. The proposed method is subsequently validated on an experiment data with a known nominal surface. It is demonstrated that the proposed method offers a fast computational time that allow for online surface estimation.

About this research paper

What this paper is about

A two-step fast non-uniform knot placement algorithm applicable for noisy data is presented in this paper. The algorithm is started by evaluating the second derivative of the sampled data and, subsequently, by using the half-split approach, the best piecewise linear function is fitted to the computed derivative. In the second step, the fitted functions are adjusted to define the final knot for the B-spline fitting. The proposed method is subsequently validated on an experiment data with a known nominal surface. It is demonstrated that the proposed method offers a fast computational time that allow for online surface estimation.

Why it matters

OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

A two-step fast non-uniform knot placement algorithm applicable for noisy data is presented in this paper. The algorithm is started by evaluating the second derivative of the sampled data and, subsequently, by using the half-split approach, the best piecewise linear function is fitted to the computed derivative. In the second step, the fitted functions are adjusted to define the final knot for the B-spline fitting. The proposed method is subsequently validated on an experiment data with a known nominal surface. It is demonstrated that the proposed method offers a fast computational time that allow for online surface estimation.

Key concepts: Knot (papermaking), Piecewise, B-spline, Spline (mechanical), Algorithm, Mathematics, Surface fitting, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
A fast non-uniform knots placement method for B-spline fitting — Research Paper | ScholarLens