Worst-case optimal squares packing into disks
From MaRDI portal
Publication:5044449
DOI10.20382/JOCG.V13I2A2zbMATH Open1502.52016MaRDI QIDQ5044449FDOQ5044449
Authors: Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer 
Publication date: 31 October 2022
Recommendations
- Packing disks into disks with optimal worst-case density
- Split packing: an algorithm for packing circles with optimal worst-case density
- Split packing: algorithms for packing circles with optimal worst-case density
- Rigorous packing of unit squares into a circle
- Densest packings of equal circles in a square
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Computer assisted proofs of proofs-by-exhaustion type (68V05)
Cited In (6)
- Split packing: algorithms for packing circles with optimal worst-case density
- Split packing: packing circles into triangles with optimal worst-case density
- Packing disks into disks with optimal worst-case density
- Optimal packings of 13 and 46 unit squares in a square
- Rigorous packing of unit squares into a circle
- Split packing: an algorithm for packing circles with optimal worst-case density
This page was built for publication: Worst-case optimal squares packing into disks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044449)
