Reconstructing \((h,v)\)-convex \(2\)-dimensional patterns of objects from approximate horizontal and vertical projections.

DOI10.1016/S0304-3975(02)00072-5zbMath1044.68154OpenAlexW2019896015MaRDI QIDQ1401184

Olivier Dubois, Yacine Boufkhad, Maurice Nivat

Publication date: 17 August 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00072-5

zbMATH Keywords

satisfiabilitypolyominoDiscrete tomography

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10)

Related Items (3)

Stability in discrete tomography: some positive results ⋮ Reconstruction of 4- and 8-connected convex discrete sets from row and column projections ⋮ Approximating hv-Convex Binary Matrices and Images from Discrete Projections

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstructing convex polyominoes from horizontal and vertical projections
• Polyominoes defined by two vectors
• The reconstruction of polyominoes from their orthogonal projections
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections
• Characterization of Binary Patterns and Their Projections
• The reconstruction of binary patterns from their projections
• A machine program for theorem-proving

This page was built for publication: Reconstructing \((h,v)\)-convex \(2\)-dimensional patterns of objects from approximate horizontal and vertical projections.