Multiobjective Local Search Techniques for Evolutionary Polygonal Approximation

Proceedings of: 10th International Symposium on Distributed Computing and Artificial Intelligence . University of Salamanca (DCAI 2013). Salamanca, Spain, Spain, May 22-24, 2013.Polygonal approximation is based on the division of a closed curve into a set of segments. This problem has been traditionally approached as a single-objective optimization issue where the representation error was minimized according to a set of restrictions and parameters. When these approaches try to be subsumed into more recent multi-objective ones, a number of issues arise. Current work successfully adapts two of these traditional approaches and introduces them as initialization procedures for a MOEA approach to polygonal approximation, being the results, both for initial and final fronts, analyzed according to their statistical significance over a set of traditional curves from the domain.This work was supported in part by Projects MEyC TEC2012-37832-C02-01, MEyC TEC2011-28626-C02-02 and CAM CONTEXTS (S2009/TIC-1485).Publicad