Reconstruction and Enumeration of hv-Convex Polyominoes with Given Horizontal Projection
Enumeration and reconstruction of certain types of polyominoes, according to several parameters, are frequently studied problems in combinatorial image processing. Polyominoes with fixed projections play an important role in discrete tomography. In this paper, we provide a linear-time algorithm for reconstructing hv-convex polyominoes with minimal number of columns satisfying a given horizontal projection. The method can be easily modified to get solutions with any given number of columns. We also describe a direct formula for calculating the number of solutions with any number of columns, and a recursive formula for fixed number of columns.
Keywordsdiscrete tomography reconstruction enumeration polyomino hv-convexity
- 4.Del Lungo, A., Duchi, E., Frosini, A., Rinaldi, S.: Enumeration of convex polyominoes using the ECO method. In: Discrete Mathematics and Theoretical Computer Science, Proceedings, pp. 103–116 (2003)Google Scholar
- 7.Golomb, S.W.: Polyominoes. Charles Scriber’s Sons, New York (1965)Google Scholar
- 10.dos Santos, R.P., Clemente, G.S., Ren, T.I., Calvalcanti, G.D.C.: Text line segmentation based on morphology and histogram projection. In: Proceedings of the 10th International Conference on Document Analysis and Recognition, pp. 651–655 (2009)Google Scholar