Algorithms for linear time reconstruction by discrete tomography
From MaRDI portal
Publication:2009015
DOI10.1016/j.dam.2019.07.012zbMath1425.68438OpenAlexW2966841692MaRDI QIDQ2009015
Silvia M. C. Pagani, Robert Tijdeman
Publication date: 27 November 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.07.012
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Error Correction for Discrete Tomography ⋮ Algorithms for linear time reconstruction by discrete tomography. II ⋮ Boundary ghosts for discrete tomography ⋮ Three-dimensional maximal and boundary ghosts
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Discrete tomography determination of bounded lattice sets from four X-rays
- Sets uniquely determined by projections on axes. II: Discrete case
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays
- Bounds for discrete tomography solutions
- Algebraic aspects of discrete tomography
- Uniqueness Regions under Sets of Generic Projections in Discrete Tomography
- Unique reconstruction of bounded sets in discrete tomography
- A geometrical characterization of regions of uniqueness and applications to discrete tomography
- Discrete tomography: Determination of finite sets by X-rays
- Regions of Uniqueness Quickly Reconstructed by Three Directions in Discrete Tomography
- Discrete Geometry for Computer Imagery
- Discrete Geometry for Computer Imagery
- DART: A Practical Reconstruction Algorithm for Discrete Tomography
- Fast Approximation of Algebraic Reconstruction Methods for Tomography
- A Geometry Driven Reconstruction Algorithm for the Mojette Transform
- Geometrical Characterization of the Uniqueness Regions Under Special Sets of Three Directions in Discrete Tomography
This page was built for publication: Algorithms for linear time reconstruction by discrete tomography
