Volltext-Downloads (blau) und Frontdoor-Views (grau)

Learnt knot placement in B-spline curve approximation using support vector machines

  • Knot placement for curve approximation is a well known and yet open problem in geometric modeling. Selecting knot values that yield good approximations is a challenging task, based largely on heuristics and user experience. More advanced approaches range from parametric averaging to genetic algorithms. In this paper, we propose to use Support Vector Machines (SVMs) to determine suitable knot vectors for B-spline curve approximation. The SVMs are trained to identify locations in a sequential point cloud where knot placement will improve the approximation error. After the training phase, the SVM can assign, to each point set location, a so-called score. This score is based on geometric and differential geometric features of points. It measures the quality of each location to be used as knots in the subsequent approximation. From these scores, the final knot vector can be constructed exploring the topography of the score-vector without the need for iteration or optimization in the approximation process. Knot vectors computed with our approach outperform state of the art methods and yield tighter approximations.

Export metadata

Additional Services

Search Google Scholar


Author:Pascal Laube, Matthias O. FranzORCiDGND, Georg UmlaufORCiDGND
Parent Title (English):Computer Aided Geometric Design
Document Type:Article
Year of Publication:2018
Release Date:2019/01/18
First Page:104
Last Page:116
Institutes:Institut für Optische Systeme - IOS
Relevance:Peer reviewed Publikation in Master Journal List
Open Access?:Nein
Licence (German):License LogoUrheberrechtlich geschützt