Algorithm for fitting 2D polygons in an area? -

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 fit.

Note: Polygon can be rotated on the basis of the restriction set.

One possible name is one. It is related. These problems need to be NP-hard, and many need rehearsals if you can limit the polygon and allowed forms of the area, then a more efficient algorithm may be present for your particular case.