The number of convex polyominoes reconstructible from their orthogonal projections

36Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Many problems of computer-aided tomography, pattern recognition, image processing and data compression involve a reconstruction of bidimensional discrete sets from their projections. [3-5, 10, 12, 16, 17]. The main difficulty involved in reconstructing a set Δ starting out from its orthogonal projections (V,H) is the 'ambiguity' arising from the fact that, in some cases, many different sets have the same projections (V,H). In this paper, we study this problem of ambiguity with respect to convex polyominoes, a class of bidimensional discrete sets that satisfy some connection properties similar to those used by some reconstruction algorithms. We determine an upper and lower bound to the maximum number of convex polyominoes having the same orthogonal projections (V,H), with V ∈ ℕn and H ∈ ℕm. We prove that under these connection conditions, the ambiguity is sometimes exponential. We also define a construction in order to obtain some convex polyominoes having the same orthogonal projections.

Cite

CITATION STYLE

APA

Del Lungo, A., Nivat, M., & Pinzani, R. (1996). The number of convex polyominoes reconstructible from their orthogonal projections. Discrete Mathematics, 157(1–3), 65–78. https://doi.org/10.1016/S0012-365X(96)83007-X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free