A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function G(x, y, q) = sum_(m>=1) sum_(n>=1) sum_(a>=a) C(m, n, a) x^m y^n q^a, where C(m, n, a) is the number of polygons with 2m horizonal bonds, 2n vertical bonds, and area a, has been computed exactly for the bar graph polygons .

lattice polygon | self-avoiding polygon