Resumen de A practical algorithm for decomposing polygonal domains into convex polygons by diagonals

José Fernández Hernández , Boglárka Tóth, Lázaro Cánovas Martínez , Blas Pelegrín Pelegrín

• We present algorithms for decomposing a polygon (with holes) into convex polygons by diagonals. The methods are computationally quick, and although the partitions that they produce may not have minimal cardinality they usually have a low number of convex pieces. Thus, the methods are suitable for being used when achieving a modest load on the CPU time is more important than finding optimal decompositions as, for instance, in location problems.