Abstract
Letu be the union of two unit circles whose centers have a distance at most 2. Motivated by more general problems it is proved that the density of a packing of translates ofu never exceeds the density of the densest lattice-packing.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
C. A. Rogers, The closest packing of convex two-dimensional domains.Acta Math. 86 (1951), 309–321.
L. Fejes Tóth, Some packing and covering theorems.Acta Sci. Math. (Szeged) 12/A (1950), 62–67.
L. Fejes Tóth, On the densest packing of convex discs.Mathematika 30 (1983), 1–3.
L. Fejes Tóth, Densest packing of translates of a domain.Acta Math. Acad. Sci. Hungar. 45 (1984), 437–440.
L. Fejes Tóth, Über einen geometrischen Satz.Math. Z. 46 (1940), 83–85.
J. M. Wills, Research Problem 35.Period. Math. Hungar. 14 (1983), 312–314.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fejes Tóth, L. Densest packing of translates of the union of two circles. Discrete Comput Geom 1, 307–314 (1986). https://doi.org/10.1007/BF02187703
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02187703