Reconstruction of Convex Sets from One or Two X-rays
From MaRDI portal
Publication:6048184
DOI10.3233/fi-222155arXiv2211.08091OpenAlexW4385293375MaRDI QIDQ6048184
Publication date: 14 September 2023
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.08091
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)
Cites Work
- Unnamed Item
- Reconstructing convex polyominoes from horizontal and vertical projections
- A theorem on flows in networks
- Reconstruction of convex lattice sets from tomographic projections in quartic time
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Discrete tomography. Foundations, algorithms, and applications
- The reconstruction of polyominoes from their orthogonal projections
- First steps in the algorithmic reconstruction of digital convex sets
- Ambiguity results in the characterization of \(hv\)-convex polyominoes from projections
- On some geometric aspects of the class of \(hv\)-convex switching components
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses
- Regular switching components
- Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
- Characterization of hv-convex sequences
- Combinatorial Properties of Matrices of Zeros and Ones
- Discrete tomography: Determination of finite sets by X-rays
- Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets
- Properties of SAT formulas characterizing convex sets with given projections
