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 the objects as far apart as possible so that we cannot fit another object. In this paper, we consider the clumsy packing of polyominoes in a finite space, which must consider boundary conditions. We examine rectangle, L, T, and plus polyominoes of various sizes.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
