Reconstruction of Discrete Sets from Four Projections: Strong Decomposability
From MaRDI portal
Recommendations
- Discrete Geometry for Computer Imagery
- Reconstruction of 4- and 8-connected convex discrete sets from row and column projections
- scientific article; zbMATH DE number 1629857
- Decomposition algorithms for reconstructing discrete sets with disjoint components
- Reconstruction of convex 2D discrete sets in polynomial time
Cites work
- An evolutionary algorithm for discrete tomography
- Combinatorial Properties of Matrices of Zeros and Ones
- Comparison of algorithms for reconstructing hv-convex discrete sets
- Determination of Q-convex sets by X-rays
- Discrete Geometry for Computer Imagery
- Discrete Geometry for Computer Imagery
- Discrete tomography. Foundations, algorithms, and applications
- scientific article; zbMATH DE number 1551775 (Why is no real title available?)
- Matrices of zeros and ones with fixed row and column sum vectors
- Polyominoes defined by two vectors
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections
- Reconstructing convex polyominoes from horizontal and vertical projections
- Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets
- Reconstruction of convex 2D discrete sets in polynomial time
- The number of convex polyominoes reconstructible from their orthogonal projections
- The reconstruction of polyominoes from their orthogonal projections
Cited in
(3)
This page was built for publication: Reconstruction of Discrete Sets from Four Projections: Strong Decomposability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439197)