Adjust inside the encoding all one’s that identify those polygons to 0. Then the list of polygons of depth d is described given that the set of polygons which may be obtained from that encoding by connecting 1’s with a few of their neighbours in this kind of way that we get hold of a maximal polygon (which is, a polygon which is not A part of e