On closest packing by equilateral triangles
On closest packing by equilateral triangles
复制标题
关于等边三角形的最密堆积
DOI：
--
复制
发表时间：
1953
影响因子：
0.8
通讯作者：
H. Eggleston
中科院分区：
文献类型：
--
作者：
H. Eggleston
本文所讨论的问题是将不重叠的平面图形填充到给定的平面图形中的问题。这是一个不同类型的从通常的包装问题，其中使用相等的数字在整个平面上，其目的是计算的覆盖面积内的总面积的比率的限制，作为一个大的圆的半径趋于无穷大。在这个问题中，最紧密的包装是以这种方式安排的数字，这个限制达到其最大值。
The problem with which this paper is concerned is that of packing non-overlapping plane figures into a given plane figure. It is of a different type from the usual packing problem in which equal figures are used in the whole plane, and the aim is to calculate the limit of the ratio of covered area to the total area inside a large circle, as the radius of the circle tends to infinity. A closest packing in this problem is an arrangement of the figures in such a way that this limit attains its largest value.