On the Counting Sequence of Z-convex Polyominoes
This paper presents a set of formulas and equations to compute the longest counting sequence of convex polyominoes of degree of convexity at most 2.
This paper presents a novel set of formulas and equations for computing the longest counting sequence of convex polyominoes, which is a significant improvement over prior work.
Before reading this…
Applications
- →Polyomino research
- →Computer science
To understand this paper, make sure you know these concepts first:
- Convex polyominoesfind papers →
- Degree of convexityfind papers →
Abstract
More Like ThisThe 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 present a set of formulas and equations that are the basis of a C++ program that allows you to compute the longest counting sequence known to date (with respect to the area) of convex polyominoes of degree of convexity at most 2