Firefly algorithm for polynomial Bézier surface parameterization

44Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A classical issue in many applied fields is to obtain an approximating surface to a given set of data points. This problem arises in Computer-Aided Design and Manufacturing (CAD/CAM), virtual reality, medical imaging, computer graphics, computer animation, and many others. Very often, the preferred approximating surface is polynomial, usually described in parametric form. This leads to the problem of determining suitable parametric values for the data points, the so-called surface parameterization. In real-world settings, data points are generally irregularly sampled and subjected to measurement noise, leading to a very difficult nonlinear continuous optimization problem, unsolvable with standard optimization techniques. This paper solves the parameterization problem for polynomial Bézier surfaces by applying the firefly algorithm, a powerful nature-inspired metaheuristic algorithm introduced recently to address difficult optimization problems. The method has been successfully applied to some illustrative examples of open and closed surfaces, including shapes with singularities. Our results show that the method performs very well, being able to yield the best approximating surface with a high degree of accuracy. © 2013 Akemi Gálvez and Andrés Iglesias.

Cite

CITATION STYLE

APA

Gálvez, A., & Iglesias, A. (2013). Firefly algorithm for polynomial Bézier surface parameterization. Journal of Applied Mathematics, 2013. https://doi.org/10.1155/2013/237984

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free