We present a method to approximate a digital curve with a straight line sequence. The curve approximation curve has been posed as an optimization problem, and a genetic algorithm is used to solve such a problem. The proposed approach outputs a set of ending points for the line segments used to encode the resulting polygonal approximation. We have tested our method with a curve dataset composed of 11 open and closed curves. The results show that the proposed method performs qualitatively well on the test dataset. We show also quantitative measures of the similarity between the original input curve and the results of the genetic algorithm-based optimization process. © 2012 IEEE.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below