Reconstruction of convex polyominoes with a blocking component

DOI10.1016/j.tcs.2015.12.016zbMath1339.05050OpenAlexW2206388309MaRDI QIDQ265062

Stefano Brocchi, Silvia M. C. Pagani, Paolo Dulio

Publication date: 1 April 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.016

zbMATH Keywords

discrete tomographyreconstruction algorithmpolyominoesblocking componentL-convex polyominoes

Mathematics Subject Classification ID

Polyominoes (05B50)

Cites Work

• Discrete tomography determination of bounded lattice sets from four X-rays
• Reconstructing convex polyominoes from horizontal and vertical projections
• Stability results for uniquely determined sets from two directions in discrete tomography
• Sets uniquely determined by projections on axes. II: Discrete case
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• On tiling under tomographic constraints.
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections
• Conjugacy relationship between M-convex and L-convex functions in continuous variables
• The number of convex polyominoes reconstructible from their orthogonal projections
• A tiling system for the class of \(L\)-convex polyominoes
• Discrete tomography determination of bounded sets in \(\mathbb{Z}^n\)
• Discrete tomography for inscribable lattice sets
• Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
• Solving Multicolor Discrete Tomography Problems by Using Prior Knowledge
• The Reconstruction of Polyominoes from Horizontal and Vertical Projections and Morphological Skeleton is NP-complete
• Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography
• Discrete Tomography Reconstruction Algorithms for Images with a Blocking Component
• Uniqueness Regions under Sets of Generic Projections in Discrete Tomography
• Reconstruction of L-convex Polyominoes
• On the Non-additive Sets of Uniqueness in a Finite Grid
• Probabilistic Reconstruction of hv-convex Polyominoes from Noisy Projection Data
• A New Approach for the Reconstruction of Object-Based Images in Discrete Tomography
• Discrete Geometry for Computer Imagery
• Unnamed Item
• Unnamed Item

This page was built for publication: Reconstruction of convex polyominoes with a blocking component