Reconstruction of discrete sets from three or more X-rays
From MaRDI portal
Recommendations
- Reconstruction of Convex Sets from One or Two X-rays
- Discrete Q-convex sets reconstruction from discrete point X-rays
- Approximate X-rays reconstruction of special lattice sets
- Discrete tomography: Determination of finite sets by X-rays
- Reconstructing boundary points of convex sets from X-ray pictures
- Reconstructing polygons from X-rays
- On the stability of reconstructing lattice sets from X-rays along two directions
- Reconstruction of piecewise constant functions from x-ray data
- Discrete tomography determination of bounded lattice sets from four X-rays
- Reconstruction of lattice sets from their horizontal, vertical and diagonal X-rays
Cited in
(11)- An algorithm reconstructing convex lattice sets.
- Detection of the discrete convexity of polyominoes
- Polyatomic discrete tomography -- polyhedral aspects
- Solving multicolor discrete tomography problems by using prior knowledge
- Discrete Q-convex sets reconstruction from discrete point X-rays
- Reconstruction of Discrete Sets from Four Projections: Strong Decomposability
- How Many Points Can Be Reconstructed from k Projections?
- Reconstruction of decomposable discrete sets from four projections
- Reconstruction of lattice sets from their horizontal, vertical and diagonal X-rays
- X-rays characterizing some classes of discrete sets
- On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional X-rays
This page was built for publication: Reconstruction of discrete sets from three or more X-rays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2728902)
