Efficient counting of

The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction. In this paper, we show that, for any fixed integer k > 2, the number of polyominoes of area n and degree of convexity at most k can be computed in polynomial time using O(n4) space.