Reconstructing hv-convex multi-coloured polyominoes

DOI10.1016/J.TCS.2010.04.041zbMATH Open1196.68294OpenAlexW2072044129MaRDI QIDQ986548FDOQ986548

Authors: Adam Bains, Therese Biedl 

Publication date: 11 August 2010

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

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

Recommendations

• Reconstruction of convex polyominoes from orthogonal projections of their contours
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections
• Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses
• scientific article; zbMATH DE number 2080924
• scientific article; zbMATH DE number 2206365

zbMATH Keywords

algorithmscomputational geometrydiscrete tomographycombinatorial problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Discrete tomography. Foundations, algorithms, and applications
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections
• 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.
• Title not available (Why is that?)
• Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
• Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms

This page was built for publication: Reconstructing \(hv\)-convex multi-coloured polyominoes

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