Perfect packing of \(d\)-cubes
From MaRDI portal
Publication:779143
DOI10.33048/SEMI.2020.17.062zbMath1443.52014OpenAlexW3117606786MaRDI QIDQ779143
Publication date: 21 July 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.062
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)
Related Items (3)
Perfectly packing a cube by cubes of nearly harmonic sidelength ⋮ Perfectly packing a square by squares of sidelength \(f(n)^{-t}\) ⋮ Guillotine cutting is asymptotically optimal for packing consecutive squares
Cites Work
- Unnamed Item
- Unnamed Item
- Packing of odd squares revisited
- On packing of rectangles in a rectangle
- Unsolved problems in geometry
- An algorithm for packing squares
- On packing unequal rectangles in the unit square
- Two packing problems
- Compactness theorems for geometric packings
- A note on three Moser's problems and two Paulhus' lemmas
- Perfect packing of cubes
- Perfect square packings
- On packings of squares and rectangles
- On packing unequal squares
- Research Problems in Discrete Geometry
- On packing of squares and cubes
This page was built for publication: Perfect packing of \(d\)-cubes
