Polyominoes defined by two vectors
Theoretical Computer Science
Reconstructing convex polyominoes from horizontal and vertical projections
Theoretical Computer Science
The number of convex polyominoes reconstructible from their orthogonal projections
Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Reconstructing hv-convex polyominoes from orthogonal projections
Information Processing Letters
From binary to grey scale convex hulls
Fundamenta Informaticae - Special issue on mathematical morphology
The reconstruction of polyominoes from their orthogonal projections
Information Processing Letters
Reconstruction of convex 2D discrete sets in polynomial time
Theoretical Computer Science
Reconstruction in Different Classes of 2D Discrete Sets (Invited Paper)
DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
Reconstruction of 8-connected but not 4-connected hv-convex discrete sets
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
A decomposition technique for reconstructing discrete sets from four projections
Image and Vision Computing
| Hi-index | 0.00 |
In this paper we introduce the class of decomposable discrete sets and give a polynomial algorithm for reconstructing discrete sets of this class from four projections. It is also shown that the class of decomposable discrete sets is more general than the class $\mathcal {S}'_{8}$ of hv-convex 8- but not 4-connected discrete sets which was studied in [3]. As a consequence we also get that the reconstruction from four projections in $\mathcal {S}'_{8}$ can be solved in O(mn) time.