Algorithm for fitting 2D polygons in an area?

Question

Is there a standard for this? Algorithm name?

Say: I have 10 polygons of different sizes. I have an area of specific size.

I want to know how to fill the most polygons in that area, and how they are fitted.

Note: Polygons may be rotated depending on the restriction set.

Answer 1

One possible name is a Packing Problem. It is related to the Knapsack Problem. These problems tend to be NP-hard, and many require heuristics. If you can constrain the allowed forms of polygons and of the area, there may exist a more efficient algorithm for your special case.