Reconstructing convex polyominoes from horizontal and vertical projections
Theoretical Computer Science
Reconstruction of convex 2D discrete sets in polynomial time
Theoretical Computer Science
Enumeration of L-convex polyominoes by rows and columns
Theoretical Computer Science
A reconstruction algorithm for L-convex polyominoes
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Higman's Theorem on Discrete Sets
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Combinatorial aspects of L-convex polyominoes
European Journal of Combinatorics
Recognizable picture languages and polyominoes
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Higman's Theorem on Discrete Sets
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
A tiling system for the class of L-convex polyominoes
Theoretical Computer Science
Discrete tomography for inscribable lattice sets
Discrete Applied Mathematics
Solving Multicolor Discrete Tomography Problems by Using Prior Knowledge
Fundamenta Informaticae - Strategies for Tomography
Hi-index | 0.00 |
Our main purpose is to characterize the class of L-convex polyominoes introduced in [3] by means of their horizontal and vertical projections. The achieved results allow an answer to one of the most relevant questions in tomography i.e. the uniqueness of discrete sets, with respect to their horizontal and vertical projections. In this paper, by giving a characterization of L-convex polyominoes, we investigate the connection between uniqueness property and unimodality of vectors of horizontal and vertical projections. In the last section we consider the continuum environment; we extend the definition of L-convex set, and we obtain some results analogous to those for the discrete case.