Determination of optimal polygonal approximation using geneticalgorithms

摘要

A new polygonal approximation algorithm is presented which givesthe minimum number of sides for the approximated polygon under a uniformerror norm. In the proposed method, a chromosome is used to represent apolygon and is represented by a binary string. Each bit, called a gene,represents a point on the given curve. The convergence of the method isguaranteed and optimal or near-optimal solutions can be obtained. Someexperimental results depict the feasibility of the proposed approach