Skip to main content
Log in

Bounds for Totally Separable Translative Packings in the Plane

  • Published:
Discrete & Computational Geometry Aims and scope Submit manuscript

Abstract

A packing of translates of a convex domain in the Euclidean plane is said to be totally separable if any two packing elements can be separated by a line disjoint from the interior of every packing element. This notion was introduced by Fejes Tóth and Fejes Tóth (Acta Math Acad Sci Hungar 24(1–2): 229–232, 1973) and has attracted significant attention. We prove an analogue of Oler’s inequality for totally separable translative packings of convex domains and then we derive from it some new results. This includes finding the largest density of totally separable translative packings of an arbitrary convex domain and finding the smallest area convex hull of totally separable packings (resp., totally separable soft packings) generated by given number of translates of a convex domain (resp., soft convex domain). Finally, we determine the largest covering ratio (that is, the largest fraction of the plane covered by the soft disks) of an arbitrary totally separable soft disk packing with given soft parameter.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Betke, U., Henk, M., Wills, J.M.: Finite and infinite packings. J. Reine Angew. Math. 453, 165–191 (1994)

    MathSciNet  MATH  Google Scholar 

  2. Bezdek, A.: Locally separable circle packings. Studia Sci. Math. Hungar. 18(2–4), 371–375 (1983)

    MathSciNet  MATH  Google Scholar 

  3. Bezdek, K., Lángi, Zs.: Density bounds for outer parallel domains of unit ball packings. Proc. Steklov Inst. Math. 288(1), 209–225 (2015)

    Article  MathSciNet  Google Scholar 

  4. Bezdek, K., Khan, M.A., Oliwa, M.: Hadwiger and contact numbers of totally separable domains and their crystallization (2017). http://arxiv.org/abs/1703.08568v1

  5. Böröczky, K.J., Ruzsa, I.Z.: Note on an inequality of Wegner. Discrete Comput. Geom. 37(2), 245–249 (2007)

    Article  MathSciNet  Google Scholar 

  6. Edelsbrunner, H., Iglesias-Ham, M.: On the optimality of the FCC lattice for soft sphere packings. SIAM J. Discrete Math. 32(1), 750–782 (2018)

    Article  MathSciNet  Google Scholar 

  7. Fáry, I.: Sur la densité des réseaux de domaines convexes. Bull Soc. Math. France 78, 152–161 (1950)

    Article  MathSciNet  Google Scholar 

  8. Fejes Tóth, G., Fejes Tóth, L.: On totally separable domains. Acta Math. Acad. Sci. Hungar. 24(1–2), 229–232 (1973)

    Article  MathSciNet  Google Scholar 

  9. Fejes Tóth, L.: Some packing and covering theorems. Acta Sci. Math. Szeged 12(A), 62–67 (1950)

    MathSciNet  MATH  Google Scholar 

  10. Fejes Tóth, L.: Remarks on the closest packing of convex discs. Comment. Math. Helv. 53(4), 536–541 (1978)

    Article  MathSciNet  Google Scholar 

  11. Fejes Tóth, L.: On the densest packing of convex discs. Mathematika 30(1), 1–3 (1983)

    Article  MathSciNet  Google Scholar 

  12. Horváth, Á.G., Lángi, Zs: On the volume of the convex hull of two convex bodies. Monatsh. Math. 174(2), 219–229 (2014)

    Article  MathSciNet  Google Scholar 

  13. Kertész, G.: On totally separable packings of equal balls. Acta Math. Acad. Sci. Hungar. 51(3–4), 363–364 (1988)

    Article  MathSciNet  Google Scholar 

  14. Molnár, J.: On the \(\rho \)-system of unit circles. Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 20, 195–203 (1977)

    MathSciNet  MATH  Google Scholar 

  15. Oler, N.: An inequality in the geometry of numbers. Acta Math. 105, 19–48 (1961)

    Article  MathSciNet  Google Scholar 

  16. Rogers, C.A.: The closest packing of convex two-dimensional domains. Acta Math. 86, 309–321 (1951)

    Article  MathSciNet  Google Scholar 

  17. Zassenhaus, H.: Modern developments in the geometry of numbers. Bull. Am. Math. Soc. 67(5), 427–439 (1961)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

We are indebted to the anonymous referees for careful reading and valuable comments. K. Bezdek: Partially supported by a Natural Sciences and Engineering Research Council of Canada Discovery Grant. Zs. Lángi: Partially supported by the National Research, Development and Innovation Office, NKFI, K-119670, the János Bolyai Research Scholarship of the Hungarian Academy of Sciences, and grant BME FIKP-VÍZ by EMMI.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Károly Bezdek.

Additional information

Editor in Charge: János Pach

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bezdek, K., Lángi, Z. Bounds for Totally Separable Translative Packings in the Plane. Discrete Comput Geom 63, 49–72 (2020). https://doi.org/10.1007/s00454-018-0029-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00454-018-0029-6

Keywords

Mathematics Subject Classification

Navigation