この論文をさがす
説明
<jats:p>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 m<jats:sub>k</jats:sub> are given in table 1, and the corresponding "best" configurations shown in figure 1.</jats:p>
収録刊行物
-
- Canadian Mathematical Bulletin
-
Canadian Mathematical Bulletin 8 (3), 273-277, 1965-04
Canadian Mathematical Society
