LOMELI-HARO, MARIO; BORJA M, VERÓNICA    HERNANDEZ T., J. ALEJANDRO. A convex decomposition. []. , 32, 2, pp.169-180. ISSN 0120-419X.

Given a point set P on the plane, a convex decomposition of P is a set ­ of convex polygons with vertices inP satisfying the following conditions: The union of all elements in ­ is the convex hull ofP, every element in ­ is empty (that is, they no contain any element of P in its interior), and any given 2 elements in ­ its interiors are disjoint intersecting them in at most one edge. It is known that if P has n elements, then there exists a convex decomposition of P with at most elements. In this work we give a procedure to find a specific convex decomposition of P with at most elements

: Flipping edges in triangulations; convex decompositions; triangulations.

        · |     · |     · ( pdf )