Some progress in the packing of equal circles in a square (Q752482): Difference between revisions

The authors continue the investigation on the following problem: Find the shortest edge length of a square containing a packing of n unit circles or, equivalently, maximize the minimal distance between any two or n points in the unit square. An interesting case is \(n=10\), and older results to this number are here improved. Further, results for \(n=11\), 13 and 14 are given. It should be noticed, that the authors possibly did not know the results of \textit{G. Wengerodt} [see e.g. Beitr. Algebra Geom. 25, 25-46 (1987; Zbl 0647.52001)] and \textit{A. Florian} [Sitzungsber., Abt. II, Österr. Akad. Wiss. Math.-Naturwiss. Kl. 198, No.1, 27-44 (1989; Zbl 0687.52007)], to which a comparison seems to be interesting.