Reconstructing hv-convex polyominoes from orthogonal projections

We address the problem of reconstructing a discrete 2D object, represented by a set of grid cells, from its orthogonal projections. We focus on object s called hv-convex polyominoes, which are connected objects with the proper ty that the cells in each row and column are consecutive. The main result o f this paper is a simple, O(mn min(m(2), n(2)))-time algorithm for reconstr ucting hv-convex polyominoes. (C) 1999 Elsevier Science B.V. kll rights res erved.