The Reconstruction of Convex Polyominoes from Horizontal and Vertical Projections

Abstract. The problem of reconstructing a discrete set from its horizontal and vertical projections (RSP) is of primary importance in many different problems for example pattern recognition, image processing and data compression. We give a new algorithm which provides a reconstruction of convex polyominoes from horizontal and vertical projections. It costs atmost O(min(m, n)2

• Type: Conference
• Year: 1998
• Where: SOFSEM
• Authors: Maciej Gebala
• Keywords: Discrete Set, Example Pattern Recognition, SOFSEM 1998, Theoretical Computer Science, Vertical Projections