Algebraic theory of brick packing. II

DOI10.1016/0012-365X(82)90211-4zbMath0505.52005OpenAlexW4212895460MaRDI QIDQ1836392

F. W. Barnes

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(82)90211-4

zbMATH Keywords

weighting coefficientspacking of parallelepipedspartial packings

Mathematics Subject Classification ID

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

Related Items (9)

Linear relations in dissections into \(n\)-dimensional parallelepipeds ⋮ How many \(1\times 2\times 4\) bricks can you get into an odd box? ⋮ Best packing of rods into boxes ⋮ Existence of polyhedra which cannot be decomposed into simplexes of equal volume ⋮ Partitions of the phase space of a measure preserving \(\mathbb{Z}^d\)-action into towers ⋮ Tilings of a torus with rectangular boxes ⋮ Data analysis using a geometrical representation of predicate calculus ⋮ Packing \(1\times 2\times 4\) bricks in a cubical box ⋮ An algebraic geometric approach to Nivat's conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Algebraic theory of brick packing. I
• Packing the maximum number of \(m\times n\) tiles in a large \(p\times q\) rectangle
• Packing boxes with harmonic bricks

This page was built for publication: Algebraic theory of brick packing. II