Barcucci, E., Del Lungo, A., Nivat, M. and Pinzani, R. (1996) Reconstructing Convex Polyominoes from Horizontal and Vertical Projections. Theoretical Computer Science, 155, 321-347.
https://doi.org/10.1016/0304-3975(94)00293-2

has been cited by the following article:

• TITLE: 2-Convex Polyominoes: Non-Empty Corners

  AUTHORS: Khalil Tawbe, Nadine Ghandour, Ali Atwi

  KEYWORDS: Polyomino, Convex Objects, Monotone Path

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.9 No.2, March 7, 2019

  ABSTRACT: 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.