Reconstruction of convex 2D discrete sets in polynomial time

DOI10.1016/S0304-3975(01)00080-9zbMath0997.68152OpenAlexW1989313411WikidataQ55895940 ScholiaQ55895940MaRDI QIDQ1603651

Attila Kuba, Emese Balogh

Publication date: 15 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00080-9

zbMATH Keywords

discrete tomographyreconstruction from projectionsconvex discrete set

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (14)

DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION ⋮ Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections ⋮ Recognizable Picture Languages and Polyominoes ⋮ Reconstruction of binary matrices under fixed size neighborhood constraints ⋮ On image reconstruction algorithms for binary electromagnetic geotomography ⋮ On the generation of convex polyominoes ⋮ A reconstruction algorithm for L-convex polyominoes. ⋮ Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets ⋮ Convex \((0, 1)\)-matrices and their epitopes ⋮ Comparison of algorithms for reconstructing \(hv\)-convex discrete sets ⋮ Solving nonograms by combining relaxations ⋮ Reconstruction of L-convex Polyominoes ⋮ Reconstruction of binary matrices under adjacency constraints ⋮ Reconstruction of Discrete Sets from Four Projections: Strong Decomposability

Cites Work

• Unnamed Item
• Reconstructing convex polyominoes from horizontal and vertical projections
• Matrices of zeros and ones with fixed row and column sum vectors
• Switching components and the ambiguity problem in the reconstruction of pictures from their projections
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Discrete tomography. Foundations, algorithms, and applications
• The reconstruction of polyominoes from their orthogonal projections
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections
• The number of convex polyominoes reconstructible from their orthogonal projections
• Combinatorial Properties of Matrices of Zeros and Ones
• Reconstruction of 4- and 8-connected convex discrete sets from row and column projections

This page was built for publication: Reconstruction of convex 2D discrete sets in polynomial time