Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9514646 | Electronic Notes in Discrete Mathematics | 2005 | 17 Pages |
Abstract
In this paper we introduce the class of strongly decomposable discrete sets and give an efficient algorithm for reconstructing discrete sets of this class from four projections. It is also shown that every Q-convex set (along the set of directions {x, y}) consisting of several components is strongly decomposable. As a consequence of strong decomposability we get that in a subclass of hv-convex discrete sets the reconstruction from four projections can be solved in polynomial time.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Péter Balázs,