An integer programming formulation using convex polygons for the convex partition problem

Hadrien Cambazard, Nicolas Catusse

A convex partition of a point set P in the plane is a planar partition of the convex hull of P with empty convex polygons or internal faces whose extreme points belong to P. In a c…