The Densest Packing of 9 Circles in a Square
- 1 April 1965
- journal article
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 8 (3) , 273-277
- https://doi.org/10.4153/cmb-1965-018-9
Abstract
Packing problems of this kind are obviously equivalent to the problems of placing k (here 9) points in a unit square such that the minimum distance between any two of them be as large as possible. The solutions of these problems are known for 2 ≤ k ≤ 9. The largest possible minimum distances mk are given in table 1, and the corresponding "best" configurations shown in figure 1.Keywords
This publication has 1 reference indexed in Scilit:
- On a Geometric Extremum ProblemCanadian Mathematical Bulletin, 1965