Packing squares into a disk with optimal worst-case density

DOI10.4230/LIPICS.SOCG.2021.36MaRDI QIDQ7234093zbMATH OpenFDO

Authors Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer

Publication date 27 April 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2021.36

zbMATH Keywords

approximationinterval arithmeticpacking densitysquare packingtight worst-case bound

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A formal proof of the Kepler conjecture
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• A proof of the Kepler conjecture
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Computer solution to the 17-point Erdős-Szekeres problem
• Double bubbles minimize
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• scientific article; zbMATH DE number 1241839 (Why is no real title available?)
• scientific article; zbMATH DE number 2117213 (Why is no real title available?)
• Minimum-weight triangulation is NP-hard
• New classes of fast lower bounds for bin packing problems
• Optimal circle covering problems and their applications
• Packing disks into disks with optimal worst-case density
• Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
• Proof of the double bubble conjecture
• Some packing and covering theorems
• Split packing: algorithms for packing circles with optimal worst-case density
• Split packing: an algorithm for packing circles with optimal worst-case density
• The four-colour theorem
• Two-dimensional packing problems: a survey
• Worst-case optimal covering of rectangles by disks

This page was built for publication: Packing squares into a disk with optimal worst-case density

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7234093)