2-Convex Polyominoes: Non-Empty Corners
Khalil Tawbe, Nadine Ghandour, Ali Atwi
Abstract
Open-access reader
Khalil Tawbe, Nadine Ghandour, Ali Atwi
Abstract
Open-access reader
A polyomino P is called 2-convex if for every two cells there exists a monotone path included in P with at most two changes of direction. This paper studies the geometrical properties of a sub-class of 2-convex polyominoes called where the upper left corner and the lower right corner of the polyomino each contains only one cell.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A polyomino P is called 2-convex if for every two cells there exists a monotone path included in P with at most two changes of direction. This paper studies the geometrical properties of a sub-class of 2-convex polyominoes called where the upper left corner and the lower right corner of the polyomino each contains only one cell.
Key concepts: Polyomino, Monotone polygon, Mathematics, Combinatorics, Regular polygon, Path (computing), Class (philosophy), Discrete mathematics