Efficient counting of k-convex polyominoes

Key Points

• The number of k-convex polyominoes can be efficiently counted based on the area.
• The proposed method operates in polynomial time with a space complexity of O(n^4).
• The approach focuses on the degree of convexity, highlighting changes of direction in the structure.
• This work extends counting techniques for convex polyominoes, providing new insights into combinatorial geometry.