Properties of SAT formulas characterizing convex sets with given projections
From MaRDI portal
Publication:6160797
Recommendations
- Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses
- Reconstructing \((h,v)\)-convex \(2\)-dimensional patterns of objects from approximate horizontal and vertical projections.
- Reconstructing convex polyominoes from horizontal and vertical projections
- Reconstruction of canonical \(hv\)-convex discrete sets from horizontal and vertical projections
- Reconstruction of convex polyominoes from orthogonal projections of their contours
Cites work
- A measure of directional convexity inspired by binary tomography
- Certain words on the real projective line
- Characterization of hv-convex sequences
- Combinatorics on Words
- Discrete tomography. Foundations, algorithms, and applications
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- Lyndon + Christoffel = digitally convex
- On 3-hypergraphs with equal degree sequences.
- On some geometric aspects of the class of \(hv\)-convex switching components
- Reconstructing convex polyominoes from horizontal and vertical projections
- Regular switching components
- The number of convex polyominoes reconstructible from their orthogonal projections
- Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses
Cited in
(2)
This page was built for publication: Properties of SAT formulas characterizing convex sets with given projections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160797)