Asymptotically optimal box packing theorems

zbMATH Open1179.05028MaRDI QIDQ1010801FDOQ1010801

Authors: J. Martínez 

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Klarner systems and tiling boxes with polyominoes
• Packing Boxes with Bricks
• Two problems about tiling in discrete geometry
• When can you tile a box with translates of two given rectangular bricks?
• Filling a box with translates of two bricks

zbMATH Keywords

polyominoesbox packingprotoset

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Polyominoes (05B50)

Cited In (7)

• Many L-shaped polyominoes have odd rectangular packings
• Klarner systems and tiling boxes with polyominoes
• Polynomials and packings: A new proof of de Bruijn's theorem
• Title not available (Why is that?)
• Asymptotics of weighted best-packing on rectifiable sets
• Coloring and boundary invariants for polyominoes
• Packing polyominoes clumsily

This page was built for publication: Asymptotically optimal box packing theorems

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