Abstract.
The problem of maximizing the radius of n equal circles that can be packed into a given square is a well-known geometrical problem. An equivalent problem is to find the largest distance d, such that n points can be placed into the square with all mutual distances at least d. Recently, all optimal packings of at most 20 circles in a square were exactly determined. In this paper, computational methods to find good packings of more than 20 circles are discussed. The best packings found with up to 50 circles are displayed. A new packing of 49 circles settles the proof that when n is a square number, the best packing is the square lattice exactly when n≤ 36.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received April 24, 1995, and in revised form June 14, 1995.
Rights and permissions
About this article
Cite this article
Nurmela, K., Östergård, P. Packing up to 50 Equal Circles in a Square. Discrete Comput Geom 18, 111–120 (1997). https://doi.org/10.1007/PL00009306
Issue Date:
DOI: https://doi.org/10.1007/PL00009306