Reconstruction of discrete sets from two absorbed projections: an algorithm

Two left and right horizontal absorbed projections along a single direction uniquely determine a row of a binary matrix. After proving this result we give a polynomial time algorithm which reconstructs such a row and we analyze its performances by determining the worst case complexity.