A new polygonal approximation algorithm, employing the concept of genetic evolution, is presented. In the proposed method, a chromosome is used to represent a polygon by a binary string. Each bit, called a gene, represents a point on the given curve. Three genetic operators, including selection, crossover, and mutation, are designed to obtain the approximated polygon whose error is bounded by a given norm. Many experiments show that the convergence is guaranteed and the optimal or near-optimal solutions can be obtained. Compared with the Zhu-Seneviratne algorithm, the proposed algorithm successfully reduced the number of segments under the same error condition in the polygonal approximation.
|頁（從 - 到）||297-314|
|期刊||International Journal of Pattern Recognition and Artificial Intelligence|
|出版狀態||Published - 2000 五月|
All Science Journal Classification (ASJC) codes