Perfect packing of cubes

DOI10.1007/S10474-018-0858-ZMaRDI QIDQ1714970zbMATH OpenOpenAlexWikidataFDO

Authors Antal Joós

Publication date 1 February 2019

Published in Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10474-018-0858-z

zbMATH Keywords

perfect packingcubepackingrectangular prism

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Combinatorial aspects of packing and covering (05B40)

Recommendations

• Perfect packing of \(d\)-cubes
• Perfectly packing a cube by cubes of nearly harmonic sidelength
• Perfect square packings
• A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\)
• A note on perfect packing of squares and cubes
• On packings of squares and rectangles
• An algorithm for packing squares
• Packing of odd squares revisited
• On packing unequal squares
• On packing unequal rectangles in the unit square

Cited in

(7)

• A note on perfect packing of squares and cubes
• scientific article; zbMATH DE number 1512676 (Why is no real title available?)
• Best packing of rods into boxes
• Perfect packing of \(d\)-cubes
• Perfectly packing a square by squares of sidelength \(f(n)^{-t}\)
• Perfectly packing a cube by cubes of nearly harmonic sidelength
• Guillotine cutting is asymptotically optimal for packing consecutive squares

This page was built for publication: Perfect packing of cubes

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