Saved in:
| Main Author: | |
|---|---|
| Format: | Artículo científico |
| Language: | en |
| Published: |
Universidad de Guanajuato
2012
|
| Subjects: | |
| Online Access: | https://www.redalyc.org/articulo.oa?id=41623190002 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Polygonal Approximation of Digital Curves Using Evolutionary Programming Paola B. Alvarado-Velazco Victor Ayala-Ramirez Raul E. Sanchez-Yanez Multidisciplinarias (Ciencias Sociales) evo optimization digital curves lutionary programming Polygonal approximation This paper proposes an Evolutionary Programming (EP) approach to solve the polygonal ap- proximation of digital curves. The solution provided by the method consists of a sequence of straight line segments to be applied as Advance and Rotate motion primitives of a 2D Cartesian robot. The proposed approach finds automatically the number of segments and the startingand ending points of each of them. We have tested our approach on a test set of digital curves that exhibits two main qualitative features: openess and straightness, in different degrees. We show that our method obtains good results for approximating the curves in the test set. We present both quantitative and qualitative results of these test. 2012 artículo científico 0188-6266 https://www.redalyc.org/articulo.oa?id=41623190002 en http://www.redalyc.org/revista.oa?id=416 Acta Universitaria application/pdf Universidad de Guanajuato Acta Universitaria (México) Vol.22