Tiling with bars under tomographic constraints.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- Approximating the number of monomer-dimer coverings of a lattice.
- Markov chain algorithms for planar lattice structures
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
- Reconstruction of domino tiling from its two orthogonal projections
Cited in
(10)- scientific article; zbMATH DE number 404129 (Why is no real title available?)
- Tile-packing tomography is \(\mathbb{NP}\)-hard
- On tiling under tomographic constraints.
- A heuristic approach to domino grid problem
- A MIP flow model for crop-rotation planning in a context of forest sustainable development
- The reconstruction of a subclass of domino tilings from two projections
- Reconstruction of binary matrices under fixed size neighborhood constraints
- Complexity results for the horizontal bar packing problem
- Eric Goles
- Spotlight tiling
This page was built for publication: Tiling with bars under tomographic constraints.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401161)