Complexity of two-dimensional patterns

To describe quantitatively the complexity of two-dimensional patterns we in troduce a complexity measure based on a mean information gain. Two types of patterns are studied: geometric ornaments and patterns arising in random s equential adsorption of discs on a plane (RSA). For the geometric ornaments analytical expressions for entropy and complexity measures are presented, while for the RSA patterns these are calculated numerically. We compare the information-gain complexity measure with some alternative measures and sho w advantages of the former one, as applied to two-dimensional structures. N amely, this does not require knowledge of the "maximal" entropy of the patt ern, and at the same time sensitively accounts for the inherent correlation s in the system.