a generalization of previous problems is the problem of partitioning to polygons that have exactly "m" sides, or at most "m" sides. here the goal is to minimize the total edge length. this problem can be solved in time polynomial in "n" and "m".