Reconstruction of 2-Convex Polyominoes with Non-Empty Corners  

作　　者：Khalil Tawbe Salwa Mansour 

机构地区：[1]Department of Mathematics,Lebanese University,Beirut,Lebanon [2]Department of Mathematics,The International University of Beirut,Beirut,Lebanon [3]Department of Mathematics,Lebanese International University,Beirut,Lebanon.

出　　处：《Open Journal of Discrete Mathematics》2019年第4期83-109,共27页离散数学期刊（英文）

摘　　要：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 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ürr for HV-convex polyominoes in order to impose these geometries.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 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ürr for HV-convex polyominoes in order to impose these geometries.

关 键 词：POLYOMINO CONVEX Objects MONOTONE Path 

分 类 号：O17[理学—数学]