请输入您要查询的百科知识:

 

词条 Circle packing in an isosceles right triangle
释义

  1. References

Circle packing in a right isosceles triangle is a packing problem where the objective is to pack n unit circles into the smallest possible isosceles right triangle.

Minimum solutions (lengths shown are length of leg) are shown in the table below.[1] Solutions to the equivalent problem of maximizing the minimum distance between n points in an isosceles right triangle, are known to be optimal for n< 8.[2] In 2011 a heuristic algorithm found 18 improvements on previously known optima, the smallest of which was for n=13.[3]

Number of circles Length
1 = 3.414...
2 = 4.828...
3 = 5.414...
4 = 6.242...
5 = 7.146...
6 = 7.414...
7 = 8.181...
8 = 8.692...
9 = 9.071...
10 = 9.414...
11 = 10.059...
12 10.422...
13 10.798...
14 = 11.141...
15 = 11.414...

References

1. ^{{cite web|url=http://hydra.nat.uni-magdeburg.de/packing/crt/crt.html|title=The best known packings of equal circles in an isosceles right triangle|first=Eckard|last=Specht|date=2011-03-11|accessdate=2011-05-01}}
2. ^{{Cite journal | last1 = Xu | first1 = Y. | title = On the minimum distance determined by n (≤ 7) points in an isoscele right triangle | doi = 10.1007/BF02007736 | journal = Acta Mathematicae Applicatae Sinica | volume = 12 | issue = 2 | pages = 169–175 | year = 1996 | pmid = | pmc = }}
3. ^{{Cite journal | last1 = López | first1 = C. O. | last2 = Beasley | first2 = J. E. | title = A heuristic for the circle packing problem with a variety of containers | doi = 10.1016/j.ejor.2011.04.024 | journal = European Journal of Operational Research | volume = 214 | issue = 3 | pages = 512 | year = 2011 | pmid = | pmc = }}
{{Packing problem}}{{elementary-geometry-stub}}

1 : Circle packing

随便看

 

开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。

 

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间:2024/11/10 6:44:46