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...
Saved in:
| Published in | Mathematics and computers in simulation Vol. 186; pp. 91 - 102 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
01.08.2021
Elsevier |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0378-4754 1872-7166 1872-7166 |
| DOI | 10.1016/j.matcom.2020.07.021 |
Cover
| 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 |