a partition of a polygon is a set of primitive units (e.g. squares), which do not overlap and whose union equals the polygon. a polygon partition problem is a problem of finding a partition which is minimal in some sense, for example a partition with a smallest number of units or with units of smallest total side-length.