Density of binary disc packings: the nine compact packings (Q2118217)

A packing of the Euclidean plane by discs of two given radii \(1\) and \(r \in (0,1)\) is called binary. It is called compact if its contact graph is a triangulation. There are exactly nine different radii \(r\) such that there is a corresponding binary compact packing, see [\textit{T. Kennedy}, Discrete Comput. Geom. 35, No. 2, 255--267 (2006; Zbl 1092.52010)]. It is shown for each of these radii \(r\), that there is no denser packing by discs of radii \(1\) and \(r\) than a respective periodic compact packing with the same radii, which is explicitly given. The proof is based in parts on computer assistance.