凸域上的全等截块
Cutting Mutually Congruent Pieces from Convex Regions
摘要：
当切下2个具有最大可能面积的相互全等的凸块时，留下P的面积的最大部分的2D凸区域P的形状是什么？当P被限制为所有可能的三角形形状的集合时，我们的计算搜索在任何三角形被赋予其最佳（最大面积利用）划分为2个凸块时浪费的面积上产生大约5.6%的上界。然后，我们产生的一般凸区域，浪费了最好的凸2-分区不是一个三角形的面积的证据，并简要讨论了一些进一步的推广问题。
英文摘要：
What is the shape of the 2D convex region P from which, when 2 mutually congruent convex pieces with maximum possible area are cut out, the highest fraction of the area of P is left over? When P is restricted to the set of all possible triangular shapes, our computational search yields an approximate upper bound of 5.6% on the area wasted when any triangle is given its best (most area utilizing) partition into 2 convex pieces. We then produce evidence for the general convex region which wastes the most area for its best convex 2-partition not being a triangle and briefly discuss some further generalizations of the question.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
