Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses

DOI10.1016/j.tcs.2019.01.001zbMath1426.68272OpenAlexW2908207504MaRDI QIDQ2422035

Laurent Vuillon, Andrea Frosini

Publication date: 18 June 2019

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

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

zbMATH Keywords

discrete tomography2-convex polyominoesdual Horn clauses

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyominoes (05B50)

Related Items (4)

Reconstruction of Convex Sets from One or Two X-rays ⋮ Characterization of hv-convex sequences ⋮ Properties of SAT formulas characterizing convex sets with given projections ⋮ On some geometric aspects of the class of \(hv\)-convex switching components

Cites Work

• The medians of discrete sets
• On computing the degree of convexity of polyominoes
• On the exhaustive generation of \(k\)-convex polyominoes
• Reconstructing convex polyominoes from horizontal and vertical projections
• Counting polyominoes: yet another attack
• On translating one polyomino to tile the plane
• Medians of discrete sets according to a linear distance
• Discrete tomography. Foundations, algorithms, and applications
• Tiling with polyominoes and combinatorial group theory
• The number of convex polyominoes reconstructible from their orthogonal projections
• A tiling system for the class of \(L\)-convex polyominoes
• The number of Z-convex polyominoes
• A reconstruction algorithm for L-convex polyominoes.
• Enumeration of L-convex polyominoes by rows and columns
• 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.
• Permutation classes and polyomino classes with excluded submatrices
• Reconstruction of L-convex Polyominoes
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Covering Regions by Rectangles
• Checker Boards and Polyominoes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses