A convex polyomino can be easily represented by a pair of suitable integer vectors. This lets us design a CAT (Constant Amortized Time) algorithm for generating all convex polyominoes of size n using O(n) space.
On the Generation of Convex Polyominoes
MASSAZZA, PAOLO
2015-01-01
Abstract
A convex polyomino can be easily represented by a pair of suitable integer vectors. This lets us design a CAT (Constant Amortized Time) algorithm for generating all convex polyominoes of size n using O(n) space.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
1-s2.0-S0166218X14001012-main.pdf
non disponibili
Tipologia:
Documento in Post-print
Licenza:
DRM non definito
Dimensione
471.52 kB
Formato
Adobe PDF
|
471.52 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.
