### Abstract

One important class of discrete sets where the reconstruction from two given projections can be solved in polynomial time is the class of hv-convex 8-connected sets. The worst case complexity of the fastest algorithm known so far for solving the problem is of O(mn· min{m^{2},n^{2}}) [2]. However, as it is shown, in the case of 8-connected but not 4-connected sets we can give an algorithm with worst case complexity of O(mn·min{m,n}) by identifying the so-called S_{4}-components of the discrete set. Experimental results are also presented in order to investigate the average execution time of our algorithm.

Original language | English |
---|---|

Pages (from-to) | 388-397 |

Number of pages | 10 |

Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Volume | 2886 |

Publication status | Published - Dec 1 2003 |

### Fingerprint

### Keywords

- Convex and connected discrete set
- Discrete tomography
- Reconstruction

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)