Pages that link to "Item:Q1251083"
From MaRDI portal
The following pages link to Switching components and the ambiguity problem in the reconstruction of pictures from their projections (Q1251083):
Displaying 13 items.
- Reconstructing convex matrices by integer programming approaches (Q387306) (← links)
- Reconstructing convex polyominoes from horizontal and vertical projections (Q672143) (← links)
- Switching components and the ambiguity problem in the reconstruction of pictures from their projections (Q1251083) (← links)
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays (Q1301705) (← links)
- Reconstruction of convex 2D discrete sets in polynomial time (Q1603651) (← links)
- Reconstructing permutation matrices from diagonal sums (Q1603693) (← links)
- Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets (Q1775617) (← links)
- The number of convex polyominoes reconstructible from their orthogonal projections (Q1924359) (← links)
- Further steps on the reconstruction of convex polyominoes from orthogonal projections (Q2084620) (← links)
- Solving the Two Color Problem: An Heuristic Algorithm (Q3003544) (← links)
- The smallest sets of points not determined by their X-rays (Q5173359) (← links)
- X-rays characterizing some classes of discrete sets (Q5955122) (← links)
- Reconstruction of 4- and 8-connected convex discrete sets from row and column projections (Q5955124) (← links)