Figure 7 - uploaded by Sidharth Dhawan
Content may be subject to copyright.
case 4: the group is collectively y -monotone 

case 4: the group is collectively y -monotone 

Source publication
Article
Full-text available
Polyominoes are a subset of polygons which can be constructed from integer-length squares fused at their edges. A system of polygons P is interlocked if no subset of the polygons in P can be removed arbitrarily far away from the rest. It is already known that polyominoes with four or fewer squares cannot interlock. It is also known that determining...

Context in source publication

Context 1
... treat the U as a 2 3 rectangle, which is y -monotone. In the second case, there are two polyominoes in the group, and it is orthogonally convex. In this case, the group is by definition y -monotone. In the third case, there are two polyominoes in the group, which is not orthogonally convex. It can be shown by a case analysis (see Figure 6) that all of these groups are y monotone, although they are not x -monotone. In the last case, there are two U ’s grouped with the same third polyomino. In order to touch a U ’s pocket, a polyomino must have a square in which three edges are exposed. Since any pentomino can have at most two of these partially exposed squares oriented in the y -direction, the largest number of U ’s that be attached to any pentomino is two. After these three pentominoes are grouped together, no more U ’s can attach, because the group no longer has any vertically oriented partially exposed squares. We further claim that any group formed by two U ’s and a third pentomino must be y -monotone. The accuracy of these claims is verified by the case analysis shown in Figure 7. Thus, we have proved the claim that pentominoes cannot interlock. Next, we find a lower bound for polyomino interlockedness. We show that hexominoes can interlock. We also investigate the computational complexity of deciding interlockedness of systems containing ...

Similar publications

Article
Full-text available
A famous result of D. Walkup states that the only rectangles that may be tiled by the T-tetromino are those in which both sides are a multiple of four. In this paper we examine the rest of the rectangles, asking how many T-tetrominos may be placed into those rectangles without overlap, or, equivalently, what is the least number of gaps that need to...