Rigorous packing of unit squares into a circle

This paper considers the task of finding the smallest circle into which one can pack a fixed number of non-overlapping unit squares that are free to rotate. Due to the rotation angles, the packing of unit squares into a container is considerably harder to solve than their circle packing counterparts...

Descripción completa

Detalles Bibliográficos
Autores principales: Montanher, Tiago, Neumaier, Arnold, Csaba Markót, Mihály, Domes, Ferenc, Schichl, Hermann
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2018
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6394747/
https://www.ncbi.nlm.nih.gov/pubmed/30880874
http://dx.doi.org/10.1007/s10898-018-0711-5

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6394747/
https://www.ncbi.nlm.nih.gov/pubmed/30880874
http://dx.doi.org/10.1007/s10898-018-0711-5

Ejemplares similares