A note on perfect packing of \(d\)-dimensional cubes

DOI10.33048/SEMI.2020.17.075zbMath1452.52013OpenAlexW3115728448MaRDI QIDQ2200981

Janusz Januszewski, Łukasz Zielonka

Publication date: 24 September 2020

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33048/semi.2020.17.075

zbMATH Keywords

boxtilingperfect packing\(d\)-cube

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Related Items (4)

Perfectly packing a cube by cubes of nearly harmonic sidelength ⋮ Perfectly packing a square by squares of sidelength \(f(n)^{-t}\) ⋮ Efficient 1-space bounded hypercube packing algorithm ⋮ Guillotine cutting is asymptotically optimal for packing consecutive squares

This page was built for publication: A note on perfect packing of \(d\)-dimensional cubes