# Minimum Convex Partition of Point Sets is NP-Hard

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? What if the vertices of these polygons are constrained to be points of P? We show that the first decision problem is NP-hard, and the second NP-complete.

READ FULL TEXT