Title :
Firefly Algorithm for Bezier Curve Approximation
Author :
Galvez, Akemi ; Iglesias, Andres
Author_Institution :
Dept. of Appl. Math. & Comput. Sci. E.T.S.I. Caminos, Univ. of Cantabria, Santander, Spain
Abstract :
A critical problem in many applied fields is to constructthe polynomial curve of a certain degree that approximatesa given set of noisy data points better in the sense of least-squares. This problem arises in a number of areas, suchas Computer-Aided Design & Manufacturing (CAD/CAM), virtual reality, medical imaging, computer animation, andmany others. This paper introduces a new method to solvethis problem through free-form Bezier curves. Our methodapplies a powerful metaheuristic nature-inspired algorithm, called firefly algorithm, introduced recently to solve optimization problems. The paper shows that this new approach can be effectively applied to obtain an optimal approximating Bezier curve to the set of data points with a proper selection of the control parameters. To check the performance of our approach, it has been applied to some illustrative examples of different types, including shapes with complex features such as singularities and self-intersections. Our results show that the method performs very well, being able to yield the best approximating curve with a high degree of accuracy.
Keywords :
computational geometry; curve fitting; optimisation; polynomial approximation; control parameter selection; data points; firefly algorithm; free-form BIzier curves; metaheuristic nature-inspired algorithm; optimal Bezier curve approximation; optimization problem; polynomial curve; Approximation algorithms; Approximation methods; Minimization; Noise; Noise measurement; Polynomials; Shape; Bezier curves; curve approximation; data fitting; firefly algorithm; metaheuristic;
Conference_Titel :
Computational Science and Its Applications (ICCSA), 2013 13th International Conference on
Conference_Location :
Ho Chi Minh City
DOI :
10.1109/ICCSA.2013.21