Abstract.
The densest packings of n equal circles in a square have been determined earlier for n ≤ 20 and for n = 25, 36 . Several of these packings have been proved with the aid of a computer. The computer-aided approach is further developed here and the range is extended to n ≤ 27 . The optimal packings are depicted.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received February 11, 1998, and in revised form December 17, 1998.
Rights and permissions
About this article
Cite this article
Nurmela, K., Ostergå rd, P. More Optimal Packings of Equal Circles in a Square . Discrete Comput Geom 22, 439–457 (1999). https://doi.org/10.1007/PL00009472
Issue Date:
DOI: https://doi.org/10.1007/PL00009472