Abstract
We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason—the problem of “super resolution of images.” We have found optimal arrangements for \(N=6\), 7 and 8 circles. Surprisingly, for the case \(N=7\) there are three different optimal arrangements. Our proof is based on a computer enumeration of toroidal irreducible contact graphs.
Similar content being viewed by others
Notes
By the way, the same reasons of general position help us think that if there are less then n equations, i.e., less than \(2N-1\) edges, then the space of solutions has positive dimension. Thus there is an infinitesimal motion possible and a graph with less than \(2N-1\) edges could not be an irreducible contact graph.
Recall that \(\Vert u\Vert _\infty \) is the maximal of the absolute values of the coordinates of u.
\(F_{(ij)}\) means the coordinate that corresponds to the equation for the edge ij.
References
Brass, P., Moser, W.O.J., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)
Brinkmann, G., McKay, B.D.: Fast generation of planar graphs. http://cs.anu.edu.au/~bdm/plantri/. Accessed 2012
Connelly, R.: Juxtapositions rigides de cercles et de spheres. I. Juxtapositions finies. Struct. Topol. (14), 4360 (1988) (Dual French–English text)
Connelly, R.: Juxtapositions rigides de cercles et de spheres. II. Juxtapositions infinies de mouvement fini. Struct. Topol. (16), 5776 (1990) (Dual French–English text)
Connelly, R.: Rigidity of packings. Eur. J. Comb. 29(8), 1862–1871 (2008)
Connelly, R., Dickinson, W.: Periodic planar disc packings. Philos. Trans. R. Soc. Lond. A 372, 20120039 (2014)
Conway, J.H., Sloane, N.J.A.: Sphere Packings, Lattices and Groups, 2nd edn. Springer, New York (1993)
Danzer, L.: Finite point-sets on \(\mathbf{S}^2\) with minimum distance as large as possible. Discrete Math. 60, 3–66 (1986)
Dickinson, W., Guillot, D., Keaton, A., Xhumari, S.: Optimal packings of up to five equal circles on a square flat torus. Beitr. Algebra Geom. 52(2), 315–333 (2011)
Habicht, W., van der Waerden, B.L.: Lagerungen von Punkten auf der Kugel. Math. Ann. 123, 223–234 (1951)
Melissen, J.B.M.: Densest packing of six equal circles in a square. Elem. Math. 49, 27–31 (1994)
Musin, O.R., Tarasov, A.S.: The strong thirteen spheres problem. Discrete Comput. Geom. 48, 128–141 (2012)
Schaer, J.: The densest packing of 9 circles in a square. Can. Math. Bull. 8, 273–277 (1965)
Schaer, J., Meir, A.: On a geometric extremum problem. Can. Math. Bull. 8, 21–27 (1965)
Schütte, K., Van der Waerden, B.L.: Auf welcher Kugel haben 5,6,7,8 oder 9 Punkte mit Mindestabstand 1 Platz? Math. Ann. 123, 96–124 (1951)
Schütte, K., van der Waerden, B.L.: Das Problem der dreizehn Kugeln. Math. Ann. 125, 325–334 (1953)
Sulanke, T.: Generating irreducible triangulations of surfaces. arXiv:math/0606687
Tóth, L.F.: Lagerungen in der Ebene, auf der Kugel und in Raum. Springer, New York (1953). Russian translation, Moscow, 1958
Tóth, L.F.: Regular Figures. International Series of Monographs on Pure and Applied Mathematics, vol. 48. Macmillan, New York (1964)
Usikov, D.A.: Optimal circle packings of a flat square torus. Private Communication, 2004
Acknowledgments
We wish to thank Alexey Tarasov, Vladislav Volkov and Brittany Fasy for some useful comments and remarks, and especially Thom Sulanke for modifying surftri to suit our purposes. Oleg R. Musin was partially supported by the NSF Grant DMS-1400876 and by the RFBR Grant 15-01-99563. Anton V. Nikitenko was supported by the Chebyshev Laboratory (Department of Mathematics and Mechanics, St. Petersburg State University) under RF Government Grant 11.G34.31.0026.
Author information
Authors and Affiliations
Corresponding author
Additional information
Editor in Charge: Herbert Edelsbrunner
Electronic supplementary material
Below is the link to the electronic supplementary material.
Appendices
Appendix 1: Numerical Bounds for the Graphs
Here we present the numerical bounds for the edges of \(G_1\) and \(G_2\) produced by the code
For \(G_1\) we have \(\delta <0.002\) and \(\varepsilon <0.002\). After calculating the inverse of the differential we get \(h\ge \frac{1}{16}\), and so the sufficient inequality \(\varepsilon <\frac{h}{4}\) holds.
Similarly, for \(G_2\) we get \(h\ge \frac{1}{35}\) and still \(\varepsilon < \frac{h}{4}\).
Appendix 2: Coordinates of the Graphs
Here are some exact values for the coordinates of the vertices of the optimal graphs:
The following was achieved by writing down the system of equations for the graph as it appeared to be (i.e., the edges that seem to be horizontal were assumed horizontal, etc) and solving it in MATLAB.
For \(N=7\) and 8 for all the optimal graphs we just write down the edge coordinates, as there are only 6 types of them and they look simpler than the point coordinates: \(\Big (\tfrac{1}{2} \frac{1}{1+\sqrt{3}}, \pm \tfrac{\sqrt{3}}{2}\frac{1}{1+\sqrt{3}}\Big ), \Big (\tfrac{\sqrt{3}}{2}\frac{1}{1+\sqrt{3}}, \pm \tfrac{1}{2} \frac{1}{1+\sqrt{3}}\Big ), \Big (0, \frac{1}{1+\sqrt{3}}\Big )\), \(\Big (\frac{1}{1+\sqrt{3}}, 0\Big )\).
Rights and permissions
About this article
Cite this article
Musin, O.R., Nikitenko, A.V. Optimal Packings of Congruent Circles on a Square Flat Torus. Discrete Comput Geom 55, 1–20 (2016). https://doi.org/10.1007/s00454-015-9742-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-015-9742-6