摘要
Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained. Compared to the famous Teh chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error. Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.
Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained. Compared to the famous Teh-chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error. Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.
基金
SupportedbytheNationalNaturalScienceFoundationofChinaandBeijingMunicipalNaturalSciencesFoundation .
