1. Fast Automatic Knot Placement Method for Accurate B-spline Curve Fitting
- Author
-
Raine Yeh, Tom Peterka, Youssef S. G. Nashed, and Xavier Tricoche
- Subjects
0209 industrial biotechnology ,Computer science ,Order (ring theory) ,020207 software engineering ,02 engineering and technology ,Function (mathematics) ,State (functional analysis) ,Computer Graphics and Computer-Aided Design ,Industrial and Manufacturing Engineering ,Computer Science Applications ,020901 industrial engineering & automation ,Knot (unit) ,Quality (physics) ,Feature (computer vision) ,Core (graph theory) ,0202 electrical engineering, electronic engineering, information engineering ,Variety (universal algebra) ,Algorithm ,ComputingMethodologies_COMPUTERGRAPHICS - Abstract
The choice of knot vector has immense influence on the resulting accuracy of a B-spline approximation of a curve. However, despite the significance of this problem and the various solutions that were proposed in the literature, optimizing the number and placement of knots remains a difficult task. This paper presents a novel method for the approximation of a curve by a B-spline of arbitrary order, which automatically determines a knot vector that achieves high approximation quality. At the core of our approach is a feature function that characterizes the amount and spatial distribution of geometric details in the input curve by estimating its derivatives. Knots are then selected in such a way as to evenly distribute the feature contents across their intervals. A comparison to the state of the art for a wide variety of curves shows that our method is faster and achieves more accurate reconstruction results, while typically reducing the number of necessary knots.
- Published
- 2020