  Enumeration of various types of lattice polygons and in particular
polyominoes is of primary importance in many machine learning, pattern
recognition, and geometric analysis problems. In this work, we develop a large
deviation principle for convex polyominoes under different restrictions, such
as fixed area and/or perimeter.
