We solve the problem of how to decompose a binary image into at most three convex and connected parts in polinomial time, if possible.
How to decompose a binary matrix into three hv-convex polyominoes / A. Frosini; C. Picoluleau. - ELETTRONICO. - 7749:(2013), pp. 311-322. (Intervento presentato al convegno 17th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2013 tenutosi a Seville, esp nel 2013) [10.1007/978-3-642-37067-0_27].
How to decompose a binary matrix into three hv-convex polyominoes
FROSINI, ANDREA;
2013
Abstract
We solve the problem of how to decompose a binary image into at most three convex and connected parts in polinomial time, if possible.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
