Split packing: an algorithm for packing circles with optimal worst-case density (Q4575741)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Split packing: an algorithm for packing circles with optimal worst-case density |
scientific article; zbMATH DE number 6904035
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Split packing: an algorithm for packing circles with optimal worst-case density |
scientific article; zbMATH DE number 6904035 |
Statements
Split Packing: An Algorithm for Packing Circles with Optimal Worst-Case Density (English)
0 references
16 July 2018
0 references
0.960563063621521
0 references
0.9243332147598268
0 references
0.8590879440307617
0 references
0.8442268967628479
0 references
0.822537362575531
0 references
