Packing of non-blocking cubes into the unit cube

DOI10.1007/S13366-023-00710-1MaRDI QIDQ6600956zbMATH OpenFDO

Authors Janusz Januszewski, Łukasz Zielonka

Publication date 10 September 2024

Published in Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S13366-023-00710-1

zbMATH Keywords

cubeparallel packingvolume sum

Mathematics Subject Classification ID

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

Review text

A sequence of three-dimensional cubes with edge lengths \(l_1,l_2,\ldots\) is called non-blocking if \(l_{i_1}+l_{i_2} \le 1\) whenever \(i_1 \ne i_2\). It is shown that every non-blocking sequence \((C_i)_{i=1}^\infty\) of cubes with edges parallel to the coordinate axes and of total volume at most \(1/3\) admits parallel packing into the unit cube \([0,1]^3\). That is, there are suitable translates \(\tau_1(C_1),\tau_2(C_2),\ldots\) that are placed in \([0,1]^3\) and have mutually disjoint interiors.

Recommendations

• On-line Packing Cubes into n Unit Cubes
• Packing cubes into a block
• On-line packing sequences of cubes in the unit cube
• Packing of non-blocking squares into the unit square
• A note on a cube-packing problem

Cites work

• On packing of squares and cubes
• Packing batches of cubes into a single bin
• Packing batches of items into a single bin
• Some packing and covering theorems

Cited in

(2)

• Packing of non-blocking four-dimensional cubes into the unit cube.
• Packing of non-blocking squares into the unit square

This page was built for publication: Packing of non-blocking cubes into the unit cube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6600956)