对此有一个标准？算法的名字？

Is there a standard for this? Algorithm name?

说： 我有10面不同的尺寸。 我有一个特定大小的区域。

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.

推荐答案

一个可能的名字是一个包装问题 。这是关系到背包问题。这些问题往往是NP难，许多需要启发。如果可以限制多边形和的区域的可允许的形式，也有可能存在一个更有效的算法为您的特例。

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.