Fast Polygonal Approximation Based on Genetic Algorithms

A fast algorithm is proposed for polygonal approximation of a digitized curve based on genetic evolution. The polygon is represented by a set of dominant points. The dominant points are identified as the points on the curve with local maximum curvatures. The optimization problem for the digitized curve with the approximating polygon is employing the genetic algorithm. Thus, a chromosome is used to represent a polygon. The break point detection on the chromosome is conducted to reduce the computations for optimization. Experimental results are included to show the effectiveness of this method.