Adaptive knot placement in B-spline curve approximation

An adaptive knot placement algorithm for B-spline curve approximation to dense and noisy data points is presented in this paper. In this algorithm, the discrete curvature of the points is smoothed to expose the characteristics of the underlying curve. With respect to the integration of the smoothed curvature, knots are placed adaptively to satisfy a heuristic rule. Several experimental results are included to demonstrate the validity of this algorithm.