By Topic

A robust iterative method devoted to pole curve fitting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chambelland, J.C. ; UMR CNRS, Marseille, France ; Daniel, M. ; Brun, J.M.

Applied to the general formulation of pole curves, least-square fining basically corresponds to minimize a quadratic error function d(P, t) (a sum of squared Euclidean norms) which depends on the set of control points P and nodes t linked to data points. We propose an iterative algorithm alternating between optimizing d(P, t) over t and P. Node corrections are achieved through the projection of data points on the approximation curve. Control points are updated relatively to the gradient of the error function. The method is convergent and directly applicable to every type of pole curve. Experimental results are proposed with Bezier and B-spline curves to emphasize the efficiency of this method.

Published in:

Computer Aided Design and Computer Graphics, 2005. Ninth International Conference on

Date of Conference:

7-10 Dec. 2005