Subscription or Fee Access
Multiobjective Local Search as an Initialization Procedure for Evolutionary Approaches to Polygonal Approximation
Polygonal approximation is a process based on the division of a closed curve into a shorter 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, or the number of segments minimized keeping the error value bellow a certain value. When these approaches try to be subsumed into more recent multi-objective ones, which attempt to provide a algorithm to handle these two objectives jointly, a number of issues arise. Current work successfully adapts two of these traditional approaches, bottom-up and top-down algorithms, and introduces them as initialization procedures for a multiobjective evolutionary algorithm for 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.
local search, multiobjective, segmentation, polygonal approximation, evolutionary algorithms.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.