Clumsy Packing of Polyominoes in Finite Space
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:EM2JHDH3record.jsonopen to challenge →
classification
math.CO
math.GN
keywords
packingclumsypolyominoesconsiderfiniteobjectobjectspack
read the original abstract
Clumsy packing is considered an inefficient packing, meaning we find the minimum number of objects we can pack into a space so that we can not pack any more object. Thus we are effectively spacing out the objects as far apart as possible so that we can not fit another object. In this paper we consider clumsy packing of polyominoes in a finite spaces which must consider boundary conditions. We examine rectangle, $L$, $T$, and plus polyominoes of various sizes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.