%0 Journal Article
%T Reconstruction of 2-Convex Polyominoes with Non-Empty Corners
%A Khalil Tawbe
%A Salwa Mansour
%J Open Journal of Discrete Mathematics
%P 83-109
%@ 2161-7643
%D 2019
%I Scientific Research Publishing
%R 10.4236/ojdm.2019.94009
%X This paper uses the theoretical material developed in a previous study by the authors in order to reconstruct a subclass of 2-convex polyominoes called <img src=\"Edit_30ca8f20-9c12-4e6a-b4c5-0cee083a93a9.bmp\" width=\"22\" height=\"22\" alt=\"\" /> where the upper left corner and the lower right corner of the polyomino contain each only one cell. The main idea is to control the shape of these polyominoes by using 32 types of geometries. Some modifications are made in the reconstruction algorithm of Chrobak and D<span style=\"white-space:nowrap;\">จน</span>rr for <em>HV</em>-convex polyominoes in order to impose these geometries.
%K Polyomino
%K Convex Objects
%K Monotone Path
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=94234