Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography
✍ Scribed by P. Gritzmann; D. Prangenberg; S. de Vries; M. Wiegelmann
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 223 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0899-9457
No coin nor oath required. For personal study only.
✦ Synopsis
At the conference on discrete tomography in Szeged, allow an approximation with constant error rates, while another 24-27 August, 1997, various algorithms were presented for reconeven yields a polynomial-time approximation scheme for certain structing and deciding (partial) uniqueness of finite lattice sets that subclasses of the problems. However, in general, all methods are given by their discrete X-rays in a number m of directions. The seem to be trapped by the impossibility of combining tight appresent article discusses such procedures from the point of view of proximation and high computational speed. All of this will be their worst-case running time and their approximation error. ᭧ 1998