Reconstruction of convex polyominoes with a blocking component

DOI10.1016/J.TCS.2015.12.016MaRDI QIDQ265062zbMATH OpenOpenAlexFDO

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

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

reconstruction algorithmblocking componentdiscrete tomographyL-convex polyominoespolyominoes

Mathematics Subject Classification ID

Polyominoes (05B50)

Recommendations

• \(2L\) convex polyominoes: discrete tomographical aspects
• Reconstruction of L-convex Polyominoes
• Further steps on the reconstruction of convex polyominoes from orthogonal projections
• Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses
• Ambiguous reconstructions of hv-convex polyominoes

Cites work

• scientific article; zbMATH DE number 1551773 (Why is no real title available?)
• A New Approach for the Reconstruction of Object-Based Images in Discrete Tomography
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• A tiling system for the class of \(L\)-convex polyominoes
• 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.
• Conjugacy relationship between M-convex and L-convex functions in continuous variables
• Discrete Geometry for Computer Imagery
• Discrete tomography determination of bounded lattice sets from four X-rays
• Discrete tomography determination of bounded sets in \(\mathbb{Z}^n\)
• Discrete tomography for inscribable lattice sets
• Discrete tomography reconstruction algorithms for images with a blocking component
• On the Non-additive Sets of Uniqueness in a Finite Grid
• On tiling under tomographic constraints.
• Probabilistic reconstruction of \(hv\)-convex polyominoes from noisy projection data
• Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A solution to the 2-atom problem in discrete tomography
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections
• Reconstructing convex polyominoes from horizontal and vertical projections
• Reconstruction of L-convex Polyominoes
• Reconstruction of binary matrices under adjacency constraints
• Sets uniquely determined by projections on axes. II: Discrete case
• Solving multicolor discrete tomography problems by using prior knowledge
• Stability results for uniquely determined sets from two directions in discrete tomography
• The number of convex polyominoes reconstructible from their orthogonal projections
• The reconstruction of polyominoes from horizontal and vertical projections and morphological skeleton is NP-complete
• Uniqueness regions under sets of generic projections in discrete tomography

Cited in

(2)

• Discrete tomography reconstruction algorithms for images with a blocking component
• Reconstruction of L-convex Polyominoes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q265062)