Before revision:  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 } .
After revision:  What if the vertices of these polygons are constrained to be points of P ? We show that Minimum Convex Partition is NP-hard, and the second NP-complete } .