Before revision: Given a point set P , are k closed convex polygons sufficient to partition the convex hull of P , such that the interior of a convex set contains no point in P?
After revision: We consider the Minimum Convex Partition problem: Given a set P , such that the interior of a convex set contains no point in P?