An on-line potato-sack theorem

DOI10.1007/BF02574670MaRDI QIDQ803538zbMATH OpenFDO

Authors Marek Lassak, Jixian Zhang

Publication date 1991

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/131139

zbMATH Keywords

packing of boxespacking of convex bodies

Mathematics Subject Classification ID

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

Recommendations

• On-line potato-sack algorithm efficient for packing into small boxes
• On-line covering a cube by a sequence of cubes
• On-line packing sequences of segments, cubes and boxes
• scientific article; zbMATH DE number 1054766
• Online packing of \(d\)-dimensional boxes into the unit cube

Cites work

• scientific article; zbMATH DE number 3919215 (Why is no real title available?)
• A proof of an Auerbach-Banach-Mazur-Ulam theorem on convex bodies
• Covering and packing properties of bounded sequences of convex sets
• Some packing and covering theorems
• Volumschätzung für die einen Eikörper überdeckenden und unterdeckenden Parallelotope

Cited in

(7)

• Online packing of \(d\)-dimensional boxes into the unit cube
• On-line packing and covering a disk with disks
• On the on-line number of snacks problem
• The asymptotic value of the circle-packing rigidity constants \(s_ n\)
• On-line Packing Cubes into $n$ Unit Cubes
• On-line covering a cube by a sequence of cubes
• On-line covering the unit cube by cubes

This page was built for publication: An on-line potato-sack theorem

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