An on-line potato-sack theorem

DOI10.1007/BF02574670zbMath0727.52004MaRDI QIDQ803538

Jixian Zhang, Marek Lassak

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)

Related Items (4)

On-line covering a cube by a sequence of cubes ⋮ The asymptotic value of the circle-packing rigidity constants \(s_ n\) ⋮ On-line covering the unit cube by cubes ⋮ On-line packing and covering a disk with disks

Cites Work

• Unnamed Item
• Volumschätzung für die einen Eikörper überdeckenden und unterdeckenden Parallelotope
• 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

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