On Minimal Perimeter Polyminoes

This paper explores proofs of the isoperimetric inequality for 4-connected shapes on the integer grid ℤ2, and its geometric meaning Pictorially, we discuss ways to place a maximal number unit square tiles on a chess board so that the shape they form has a minimal number of unit square neighbors Previous works have shown that “digital spheres” have a minimum of neighbors for their area We here characterize all shapes that are optimal and show that they are all close to being digital spheres In addition, we show a similar result when the 8-connectivity metric is assumed (i.e connectivity through vertices or edges, instead of edge connectivity as in 4-connectivity).

[1]  Da-Lun Wang,et al.  Discrete Isoperimetric Problems , 1977 .

[2]  H. J. Tiersma A note on Hamming spheres , 1985, Discret. Math..

[3]  Béla Bollobás,et al.  Isoperimetric Inequalities for Faces of the Cube and the Grid , 1990, Eur. J. Comb..

[4]  F. Chung Discrete isoperimetric inequalities , 1996 .

[5]  S. Bezrukov Isoperimetric Problems in Discrete Spaces , 2002 .

[6]  Israel A. Wagner,et al.  Swarm robotics for a dynamic cleaning problem , 2005, Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005..