(Re)packing Equal Disks into Rectangle

The problem of packing of equal disks (or circles) into a rectangle is a fundamental geometric problem. (By a packing here we mean an arrangement of disks in a rectangle without overlapping.) We consider the following algorithmic generalization of the equal disk packing problem. In this problem, for...

Celý popis

Podrobná bibliografie

Vydáno v:	Discrete & computational geometry Ročník 72; číslo 4; s. 1596 - 1629
Hlavní autoři:	Fomin, Fedor V., Golovach, Petr A., Inamdar, Tanmay, Saurabh, Saket, Zehavi, Meirav
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.12.2024 Springer Nature B.V
Témata:	Algorithms Combinatorics Computational Mathematics and Numerical Analysis Disks Mathematics Mathematics and Statistics Packaging Rectangles Computational geometry Circle packing 51E23: Spreads and packing problems 68W40: Analysis of algorithms Parameterized algorithms 68Q25: Analysis of algorithms and problem complexity Unit disks
ISSN:	0179-5376, 1432-0444
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!