Document

# Packing Squares into a Disk with Optimal Worst-Case Density

## File

LIPIcs.SoCG.2021.36.pdf
• Filesize: 1.62 MB
• 16 pages

## Cite As

Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, and Christian Scheffer. Packing Squares into a Disk with Optimal Worst-Case Density. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 36:1-36:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.SoCG.2021.36

## Abstract

We provide a tight result for a fundamental problem arising from packing squares into a circular container: The critical density of packing squares into a disk is δ = 8/(5π)≈ 0.509. This implies that any set of (not necessarily equal) squares of total area A ≤ 8/5 can always be packed into a disk with radius 1; in contrast, for any ε > 0 there are sets of squares of total area 8/5+ε that cannot be packed, even if squares may be rotated. This settles the last (and arguably, most elusive) case of packing circular or square objects into a circular or square container: The critical densities for squares in a square (1/2), circles in a square (π/(3+2√2) ≈ 0.539) and circles in a circle (1/2) have already been established, making use of recursive subdivisions of a square container into pieces bounded by straight lines, or the ability to use recursive arguments based on similarity of objects and container; neither of these approaches can be applied when packing squares into a circular container. Our proof uses a careful manual analysis, complemented by a computer-assisted part that is based on interval arithmetic. Beyond the basic mathematical importance, our result is also useful as a blackbox lemma for the analysis of recursive packing algorithms. At the same time, our approach showcases the power of a general framework for computer-assisted proofs, based on interval arithmetic.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Packing and covering problems
• Theory of computation → Computational geometry
##### Keywords
• Square packing
• packing density
• tight worst-case bound
• interval arithmetic
• approximation

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Mikkel Abrahamsen, Tillmann Miltzow, and Nadja Seiferth. Framework for ∃ℝ-completeness of two-dimensional packing problems. IEEE Symposium on Foundations of Computer Science (FOCS), 2020. accepted. URL: http://arxiv.org/abs/2004.07558.
2. K. Appel and W. Haken. Every planar map is four colorable. Part I. Discharging. Illinois Journal of Mathematics, 21:429-490, 1977.
3. K. Appel and W. Haken. Every planar map is four colorable. Part II. Reducibility. Illinois Journal of Mathematics, 21:491-567, 1977.
4. Archimedes. Measurement of a circle, 250 B.C.
5. Balázs Bánhelyi, Endre Palatinus, and Balázs L. Lévai. Optimal circle covering problems and their applications. Central European Journal of Operations Research, 23:815-832, 2015.
6. Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Sebastian Morr, and Christian Scheffer. Packing Geometric Objects with Optimal Worst-Case Density. In Symposium on Computational Geometry (SoCG), pages 63:1-63:6, 2019. Video available at https://www.ibr.cs.tu-bs.de/users/fekete/Videos/PackingCirclesInSquares.mp4. URL: https://doi.org/10.4230/LIPIcs.SoCG.2019.63.
7. Károly Böröczky Jr. Finite packing and covering, volume 154. Cambridge University Press, 2004.
8. Peter Brass, William OJ Moser, and János Pach. Research problems in discrete geometry. Springer Science & Business Media, 2006.
9. E. D. Demaine, S.P. Fekete, and R. J. Lang. Circle packing for origami design is hard. In Origami⁵: 5th International Conference on Origami in Science, Mathematics and Education, AK Peters/CRC Press, pages 609-626, 2011. URL: http://arxiv.org/abs/1105.0791.
10. Gábor Fejes Tóth. Recent progress on packing and covering. Contemporary Mathematics, 223:145-162, 1999.
11. S. P. Fekete and J. Schepers. New classes of fast lower bounds for bin packing problems. Mathematical Programming, 91(1):11-31, 2001.
12. S. P. Fekete and J. Schepers. A general framework for bounds for higher-dimensional orthogonal packing problems. Mathematical Methods of Operations Research, 60:311-329, 2004.
13. Sándor P. Fekete, Utkarsh Gupta, Phillip Keldenich, Christian Scheffer, and Sahil Shah. Worst-case optimal covering of rectangles by disks. In Symposium on Computational Geometry (SoCG), pages 42:1-42:23, 2020.
14. Sándor P. Fekete, Phillip Keldenich, and Christian Scheffer. Packing Disks into Disks with Optimal Worst-Case Density. In Symposium on Computational Geometry (SoCG), pages 35:1-35:19, 2019. URL: https://doi.org/10.4230/LIPIcs.SoCG.2019.35.
15. Sándor P. Fekete, Sebastian Morr, and Christian Scheffer. Split packing: Algorithms for packing circles with optimal worst-case density. Discrete & Computational Geometry, 61(3):562-594, 2019.
16. Michael R. Garey and David S. Johnson. Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing, 4(4):397-411, 1975.
17. Thomas Hales, Mark Adams, Gertrud Bauer, Tat Dat Dang, John Harrison, Le Truong Hoang, Cezary Kaliszyk, Victor Magron, Sean McLaughlin, Tat Thang Nguyen, Quang Truong Nguyen, Tobias Nipkow, Steven Obua, Joseph Pleso, Jason Rute, Alexey Solovyev, Thi Hoai An Ta, Nam Trung Tran, Thi Diep Trieu, Josef Urban, Ky Vu, and Roland Zumkeller. A formal proof of the Kepler conjecture. Forum of Mathematics, Pi, 5:e2, 2017. URL: https://doi.org/10.1017/fmp.2017.1.
18. Thomas C. Hales. A proof of the Kepler conjecture. Annals of Mathematics, 162(3):1065-1185, 2005.
19. Joel Hass and Roger Schlafly. Double bubbles minimize. Annals of Mathematics, 151(2):459-515, 2000.
20. Michael Hutchings, Frank Morgan, Manuel Ritoré, and Antonio Ros. Proof of the double bubble conjecture. Annals of Mathematics, 155(2):459-489, 2002.
21. J. Y. T. Leung, T. W. Tam, C. S. Wong, G. H. Young, and F. Y. L. Chin. Packing squares into a square. Journal of Parallel and Distributed Computing, 10(3):271–275, 1990.
22. A. Lodi, S. Martello, and M. Monaci. Two-dimensional packing problems: A survey. European Journal of Operational Research, 141(2):241–252, 2002.
23. J. W. Moon and L. Moser. Some packing and covering theorems. In Colloquium Mathematicae, volume 17, pages 103-110. Institute of Mathematics, Polish Academy of Sciences, 1967.
24. S. Morr. Split packing: An algorithm for packing circles with optimal worst-case density. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 99-109, 2017.
25. Wolfgang Mulzer and Günter Rote. Minimum-weight triangulation is NP-hard. Journal of the ACM, 55(2):11:1-11:29, 2008.
26. N. Robertson, D. Sanders, P. Seymour, and R. Thomas. The four-colour theorem. Journal of Combinatorial Theory Series B, 70:2-44, 1997.
27. George Szekeres and Lindsay Peters. Computer solution to the 17-point Erdős-Szekeres problem. The ANZIAM Journal, 48(2):151–164, 2006.
28. Gábor Fejes Tóth. Packing and covering. In Handbook of Discrete and Computational Geometry, Third Edition, pages 27-66. Chapman and Hall/CRC, 2017.
29. R. Wilson. Four colours suffice: How the map problem was solved. Princeton University Press, 2013.
X

Feedback for Dagstuhl Publishing