Polygonal approximation of digital curves using genetic algorithms

  • Alvarado-Velazco P
  • Ayala-Ramirez V
  • 10


    Mendeley users who have this article in their library.
  • 1


    Citations of this article.


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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Paola B. Alvarado-Velazco

  • Victor Ayala-Ramirez

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free