Geodesic
The Densest Packing of 9 Circles in a Square
Canadian mathematical bulletin, Tome 8 (1965) no. 3, pp. 273-277

Voir la notice de l'article provenant de la source Cambridge

DOI

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. 
Schaer, J. The Densest Packing of 9 Circles in a Square. Canadian mathematical bulletin, Tome 8 (1965) no. 3, pp. 273-277. doi: 10.4153/CMB-1965-018-9
@article{10_4153_CMB_1965_018_9,
     author = {Schaer, J.},
     title = {The {Densest} {Packing} of 9 {Circles} in a {Square}},
     journal = {Canadian mathematical bulletin},
     pages = {273--277},
     year = {1965},
     volume = {8},
     number = {3},
     doi = {10.4153/CMB-1965-018-9},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-018-9/}
}
TY  - JOUR
AU  - Schaer, J.
TI  - The Densest Packing of 9 Circles in a Square
JO  - Canadian mathematical bulletin
PY  - 1965
SP  - 273
EP  - 277
VL  - 8
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-018-9/
DO  - 10.4153/CMB-1965-018-9
ID  - 10_4153_CMB_1965_018_9
ER  - 
%0 Journal Article
%A Schaer, J.
%T The Densest Packing of 9 Circles in a Square
%J Canadian mathematical bulletin
%D 1965
%P 273-277
%V 8
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-018-9/
%R 10.4153/CMB-1965-018-9
%F 10_4153_CMB_1965_018_9

Cité par Sources :