Abstract
Given a binary matrix, deciding wether it can be decomposed into three hv-convex matrices is an -complete problem, whereas its decomposition into two hv-convex matrices or two hv-polyominoes can be performed in polynomial time. In this paper we give a polynomial time algorithm that decomposes a binary matrix into three hv-polyominoes, if such a decomposition exists. These problems are motivated by the Intensity Modulated Radiation Therapy (IMRT). © 2013 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Frosini, A., & Picouleau, C. (2013). How to decompose a binary matrix into three hv-convex polyominoes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7749 LNCS, pp. 311–322). Springer Verlag. https://doi.org/10.1007/978-3-642-37067-0_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
