On the generation of discrete figures with connectivity constraints

This paper addresses a generalization of polyominoes called (a, b)-connected discrete figures, where a and b represent the connectivity of the foreground (i.e. black pixels) and background (i.e. white pixels), respectively. Formally, a finite set of pixels P is (a, b)-connected if P is a-connected a... View More