I see a lot of packing problems focusing on covering the smallest amount of space with a given number of rectangles, but I'm trying to solve the inverse problem - I have polygon A with given vertices. I also have a group of rectangles of sizes x, y, and z (infinite amount of each size).
How would I go about finding the set of rectangles - How many of each rectangle (x,y,z) would I need to cover as much of the polygon as possible? I can rotate the rectangles if I need to, but they can't overlap
I think the simplest way would be to try to fill the polygon with as many of the largest rectangles as possible, then the second largest, etc. until it's filled.
Does anyone have any links to formulas or algorithms to solve this problem?
Thanks for the help