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. 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 and were extended up to n = 10.
In 2011 a heuristic algorithm found 18 improvements on previously known optima, the smallest of which was for n = 13.
References
- Specht, Eckard (2011-03-11). "The best known packings of equal circles in an isosceles right triangle". Retrieved 2011-05-01.
- Xu, Y. (1996). "On the minimum distance determined by n (≤ 7) points in an isoscele right triangle". Acta Mathematicae Applicatae Sinica. 12 (2): 169–175. doi:10.1007/BF02007736. S2CID 189916723.
- Harayama, Tomohiro (2000). Optimal Packings of 8, 9, and 10 Equal Circles in an Isosceles Right Triangle (Thesis). Japan Advanced Institute of Science and Technology. hdl:10119/1422.
- López, C. O.; Beasley, J. E. (2011). "A heuristic for the circle packing problem with a variety of containers". European Journal of Operational Research. 214 (3): 512. doi:10.1016/j.ejor.2011.04.024.
Packing problems | |
---|---|
Abstract packing | |
Circle packing | |
Sphere packing | |
Other 2-D packing | |
Other 3-D packing | |
Puzzles |
This elementary geometry-related article is a stub. You can help Misplaced Pages by expanding it. |