We present a characterization of Z-convex polyominoes in terms of pairs of suitable integer vectors. This lets us design an algorithm which generates all Z-convex polyominoes of size n in constant amortized time.
Castiglione, G., Massazza, P. (2014). An Efficient Algorithm for the Generation of Z-Convex Polyominoes. In R.P. Barneva, V.E. Brimkov, J. Šlapal (a cura di), Combinatorial Image Analysis (pp. 51-61). Springer International Publishing [10.1007/978-3-319-07148-0_6].
An Efficient Algorithm for the Generation of Z-Convex Polyominoes
CASTIGLIONE, Giuseppa;
2014-01-01
Abstract
We present a characterization of Z-convex polyominoes in terms of pairs of suitable integer vectors. This lets us design an algorithm which generates all Z-convex polyominoes of size n in constant amortized time.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
[28]IWCIA2014.pdf
Solo gestori archvio
Tipologia:
Versione Editoriale
Dimensione
228.75 kB
Formato
Adobe PDF
|
228.75 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
