Reconstruction of Connected Sets from Two Projections
Alberto Del Lungo, Maurice Nivat · Applied and numerical harmonic analysis · 1999
The problem of reconstructing a two-dimensional discrete set from its projections has been studied in discrete mathematics and applied in several areas. It has some interesting applications in image processing, electron microscopy, statistical data security, biplane angiography and graph theory. This chapter presents the computational complexity results of the problem of reconstructing a set from its horizontal and vertical projections with respect to some classes of sets on which some connectivity constrzints are imposed. We show that this reconstruction problem can be solved in polynomial time in a class of discrete sets, and is NP-complete otherwise. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.