Pages that link to "Item:Q1301705"
From MaRDI portal
The following pages link to On the computational complexity of reconstructing lattice sets from their \(X\)-rays (Q1301705):
Displayed 17 items.
- On the reconstruction of binary and permutation matrices under (binary) tomographic constraints (Q952460) (← links)
- A note on affinely regular polygons (Q1003588) (← links)
- Generic iterative subset algorithms for discrete tomography (Q1003704) (← links)
- An algorithm reconstructing convex lattice sets. (Q1401390) (← links)
- On the computational complexity of determining polyatomic structures by X-rays (Q1575953) (← links)
- On the algorithmic inversion of the discrete Radon transform (Q1603700) (← links)
- A short scientific biography of Maurice Nivat (Q1605477) (← links)
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections (Q1606912) (← links)
- A network flow algorithm for reconstructing binary images from discrete X-rays (Q2384105) (← links)
- An evolutionary algorithm for discrete tomography (Q2573237) (← links)
- On the X-rays of permutations (Q3439186) (← links)
- A new algorithm for 3D binary tomography (Q3439190) (← links)
- Discrete tomography: Determination of finite sets by X-rays (Q4336565) (← links)
- Selection of Local Thresholds for Tomogram Segmentation by Projection Distance Minimization (Q5458906) (← links)
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms (Q5941271) (← links)
- X-rays characterizing some classes of discrete sets (Q5955122) (← links)
- On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays (Q5955125) (← links)