A fast non-uniform knots placement method for B-spline fitting
Tegoeh Tjahjowidodo, VT. Dung, ML. Han
Abstract
Tegoeh Tjahjowidodo, VT. Dung, ML. Han
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.
OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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