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 • mnlogmn) for a matrix that has m n cells. In this paper we provide just a sketch of the algorithm.
Cite
CITATION STYLE
Gçebala, M. (1998). The reconstruction of convex polyominoes from horizontal and vertical projections. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1521, pp. 350–359). Springer Verlag. https://doi.org/10.1007/3-540-49477-4_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
