A new deterministic heuristic knots placement for B-Spline approximation

In this paper, we propose an adaptive knot placement algorithm for B-Spline curve approximation to dense and noisy 2D data points. The proposed algorithm is based on a heuristic rule for knot placement. It consists in constructing a distribution knot function by blending geometric criteria such as d...

Full description

Saved in:
Bibliographic Details
Published inMathematics and computers in simulation Vol. 186; pp. 91 - 102
Main Authors Michel, D., Zidna, A.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.08.2021
Elsevier
Subjects
Online AccessGet full text
ISSN0378-4754
1872-7166
1872-7166
DOI10.1016/j.matcom.2020.07.021

Cover

More Information
Summary:In this paper, we propose an adaptive knot placement algorithm for B-Spline curve approximation to dense and noisy 2D data points. The proposed algorithm is based on a heuristic rule for knot placement. It consists in constructing a distribution knot function by blending geometric criteria such as discrete derivatives, discrete angular variations and curvature. It has been successfully compared to three well known methods for approximating various noisy functions and sets of data in handwriting context.
ISSN:0378-4754
1872-7166
1872-7166
DOI:10.1016/j.matcom.2020.07.021