Reconstructing hv-Convex Polyominoes from Orthogonal Projections

Abstract We address the problem of reconstructing a discrete 2D object, represented by a set of grid cells, from its orthogonal projections. We focus on objects called hv-convex polyominoes, which are connected objects with the property that the cells in each row and column are consecutive. The main result of this paper is a simple, O(mn min(m2,n2))-time algorithm for reconstructing hv-convex polyominoes.