Abstract
The aim of this paper is to show an on-line algorithm for packing sequences of d-dimensional boxes of edge lengths at most 1 in a box of edge lengths at least 1. It is more efficient than a previously known algorithm in the case when packing into a box with short edges. In particular, our method permits packing every sequence of boxes of edge lengths at most 1 and of total volume at most \((1 - \frac{1} {2}\sqrt 3 )^{d - 1} \) in the unit cube. For packing sequences of convex bodies of diameters at most 1 the result is d! times smaller.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
A. Auerbach, S. Banach, S. Mazur and S. Ulam, Problem 10.1, in The Scottisch Book, ed. by R. D. Mauldin, p. 74, Birkhäuser, Boston, 1981.
H. Hadwiger, Volumschatzung für die einen Eikörper überdeckenden und unterdeckenden Parallelotope, Elem. Math. 10 (1955), 122-124.
J. Januszewski and M. Lassak, On-line packing the unit cube by cubes, Geom. Dedicata (to appear).
A. KosiŃski, A proof of an Auerbach-Banach-Mazur-Ulam theorem on convex bodies, Colloq. Math. 4 (1957), 216, 218.
M. Lassak and J. Zhang, An on-line potato-sack theorem, Discrete Comput. Geom. 6 (1991), 1-7.
Rights and permissions
About this article
Cite this article
Lassak, M. On-Line Potato-Sack Algorithm Efficient for Packing Into Small Boxes. Periodica Mathematica Hungarica 34, 105–110 (1997). https://doi.org/10.1023/A:1004280725513
Issue Date:
DOI: https://doi.org/10.1023/A:1004280725513