Tabu split and merge for the simplification of polygonal curves

Author

Ménier, Gildas ; Marteau, Pierre-François

Author_Institution

VALORIA, Univ. de Bretagne Sud, Lorient, France

fYear

2009

fDate

11-14 Oct. 2009

Firstpage

1322

Lastpage

1327

Abstract

A Tabu move merge split (TMMS) algorithm is proposed for the polygonal approximation problem. TMMS incorporates a tabu principle to avoid premature convergence into local minima. TMMS is compared to optimal, near to optimal top down multi-resolution (TDMR) and classical split and merge heuristics solutions. Experiments show that potential improvements for crudest approximations can be obtained. The evaluation is carried out on 2D geographic maps according to effectiveness and efficiency measures.

Keywords

approximation theory; computational geometry; search problems; 2D geographic maps; polygonal approximation problem; polygonal curves simplification; premature convergence; tabu move merge split algorithm; top down Multi-Resolution; Approximation algorithms; Approximation error; Cities and towns; Cybernetics; Dynamic programming; Filtering; Linear approximation; Multidimensional systems; Multiresolution analysis; USA Councils; Polygonal approximation; Split-and-Merge; Tabu search; dynamic programming; top down multi resolution;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man and Cybernetics, 2009. SMC 2009. IEEE International Conference on

Conference_Location

San Antonio, TX

ISSN

1062-922X

Print_ISBN

978-1-4244-2793-2

Electronic_ISBN

1062-922X

Type

conf

DOI

10.1109/ICSMC.2009.5346240

Filename

5346240