A TABU SEARCH APPROACH TO POLYGONAL APPROXIMATION OF DIGITAL CURVES
Peng-Yeng Yin · International Journal of Pattern Recognition and Artificial Intelligence · 2000
Most of the previous polygonal approximation methods are sub-optimal and their compression ratio with respect to a given error tolerance is not good enough for some applications. Recently, a genetic-based approach which can provide near-optimal solutions is presented, but the demands on computation and memory are too high. In this paper, a new polygonal approximation method using the tabu search technique is presented. The proposed method produces a higher compression ratio than the suboptimal approach and the genetic-based approach, and the computation cost and the memory store are more efficient.