Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T01:38:56.736Z Has data issue: false hasContentIssue false

The Densest Packing of 9 Circles in a Square

Published online by Cambridge University Press:  20 November 2018

J. Schaer*
Affiliation:
University of Alberta, Calgary
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1965