Reconstruction of 2-Convex Polyominoes with Non-Empty Corners

HTML  XML Download Download as PDF (Size: 2721KB)  PP. 83-109  
DOI: 10.4236/ojdm.2019.94009    492 Downloads   1,028 Views  
Author(s)

ABSTRACT

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.

Share and Cite:

Tawbe, K. and Mansour, S. (2019) Reconstruction of 2-Convex Polyominoes with Non-Empty Corners. Open Journal of Discrete Mathematics, 9, 83-109. doi: 10.4236/ojdm.2019.94009.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.