Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have