论文标题
在有限空间中笨拙的聚球体堆积
Clumsy Packing of Polyominoes in Finite Space
论文作者
论文摘要
笨拙的包装被认为是一种效率低下的包装，这意味着我们找到了可以包装到空间中的最小对象数量，因此我们无法再包装任何对象。因此，我们有效地将对象分开尽可能远，以使我们无法安装另一个对象。在本文中，我们考虑必须考虑必须考虑边界条件的有限空间中多支粉的笨拙堆积。我们检查矩形，$ l $，$ t $，以及各种尺寸的多元。
Clumsy packing is considered an inefficient packing, meaning we find the minimum number of objects we can pack into a space so that we can not pack any more object. Thus we are effectively spacing out the objects as far apart as possible so that we can not fit another object. In this paper we consider clumsy packing of polyominoes in a finite spaces which must consider boundary conditions. We examine rectangle, $L$, $T$, and plus polyominoes of various sizes.
