Circle packing in an isosceles right triangle
Circle packing in a right isosceles triangle is a
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, were known to be optimal for n < 8[2] and were extended up to n = 10.[3]
In 2011 a
heuristic algorithm found 18 improvements on previously known optima, the smallest of which was for n = 13.[4]
References
- ^ Specht, Eckard (2011-03-11). "The best known packings of equal circles in an isosceles right triangle". Retrieved 2011-05-01.
- S2CID 189916723.
- hdl:10119/1422.
- .