The Decomposition of a Rectangle into Rectangles of Minimal Perimeter

DOI10.1137/0217077zbMath0663.52007OpenAlexW2056427790MaRDI QIDQ3812854

David M. Mount, A. W. Roscoe, T. Yung Kong

Publication date: 1988

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/dbb690184eb04aa083e298cadf0c9bc98550d963

zbMATH Keywords

algorithmsperimeterflexible packinggrid rectangle decomposition

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (5)

\(\gamma\)-soft packings of rectangles ⋮ Exact and approximation algorithms for a soft rectangle packing problem ⋮ An approximation algorithm for dissecting a rectangle into rectangles with specified areas ⋮ On three soft rectangle packing problems with guillotine constraints ⋮ PACKING SOFT RECTANGLES

This page was built for publication: The Decomposition of a Rectangle into Rectangles of Minimal Perimeter