|
 
|
[PF13] How to decompose a binary matrix into three hv-convex polyominoes
Conférence Internationale avec comité de lecture : 17th IAPR International Conference on Discrete Geometry for Computer Imagery, March 2013, Vol. 7749, pp.311-322, Series LNCS, Séville, Espagne,
motcle:
Résumé:
Given a binary matrix, deciding wether it can be decomposed into three hv-convex matrices is an NP-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).
Equipe:
oc
BibTeX
| @inproceedings { | |||
| PF13, | |||
| title | = | "{How to decompose a binary matrix into three hv-convex polyominoes}", | |
| author | = | " C. Picouleau and A. Frosini ", | |
| booktitle | = | "{17th IAPR International Conference on Discrete Geometry for Computer Imagery}", | |
| year | = | 2013, | |
| edition | = | "Springer", | |
| month | = | "March", | |
| series | = | "LNCS", | |
| volume | = | 7749, | |
| pages | = | "311-322", | |
| address | = | "Séville, Espagne", | |
| } | |||
