On-line covering a cube by a sequence of cubes

DOI10.1007/BF02574367zbMath0815.52014OpenAlexW2083162245MaRDI QIDQ1330886

Włodzimierz Kuperberg

Publication date: 10 August 1994

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

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

zbMATH Keywords

cubeon-line coveringcube-filling Peano curve

Mathematics Subject Classification ID

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

Related Items

On-line covering the unit cube by cubes ⋮ Covering of high-dimensional cubes and quantization ⋮ On-line packing and covering a disk with disks

Cites Work

• A sufficient condition for the covering of the unit cube by homothetic copies in the \(n\)-dimensional Euclidean space
• An on-line potato-sack theorem
• Covering and packing properties of bounded sequences of convex sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item