### Abstract

The reconstruction of 8-connected but not 4-connected hv-convex discrete sets from few projections is considered. An algorithm is given with worst case complexity of O(mnmin{m,n}) to reconstruct all sets with given horizontal and vertical projections. Experimental results are also presented. It is shown, that using also the diagonal projections the algorithm can be speeded up having complexity of O(mn) and in this case the solution is uniquely determined. Finally, we consider the possible generalizations of our results to solve the problem in more general classes.

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

Pages (from-to) | 149-168 |

Number of pages | 20 |

Journal | Discrete Applied Mathematics |

Volume | 147 |

Issue number | 2-3 |

DOIs | |

Publication status | Published - Apr 15 2005 |

### Keywords

- Connected discrete set
- Discrete tomography
- Reconstruction

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Reconstruction of 8-connected but not 4-connected hv-convex discrete sets'. Together they form a unique fingerprint.

## Cite this

Balázs, P., Balogh, E., & Kuba, A. (2005). Reconstruction of 8-connected but not 4-connected hv-convex discrete sets.

*Discrete Applied Mathematics*,*147*(2-3), 149-168. https://doi.org/10.1016/j.dam.2004.09.009