2000 character limit reached
Density of binary disc packings: lower and upper bounds
Published 29 Jul 2021 in math.MG and cs.CG | (2107.14079v3)
Abstract: We provide, for any $r\in (0,1)$, lower and upper bounds on the maximal density of a packing in the Euclidean plane of discs of radius $1$ and $r$. The lower bounds are mostly folk, but the upper bounds improve the best previously known ones for any $r\in[0.11,0.74]$. For many values of $r$, this gives a fairly good idea of the exact maximum density. In particular, we get new intervals for $r$ which does not allow any packing more dense that the hexagonal packing of equal discs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.