Abstract
The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction. In this paper we present a simple algorithm for computing the degree of convexity of a convex polyomino and we show how it can be used to design an algorithm that generates, given an integer k, all k-convex polyominoes of area n in constant amortized time, using space O(n). Furthermore, by applying few changes, we are able to generate all convex polyominoes whose degree of convexity is exactly k.
Lingua originale | English |
---|---|
pagine (da-a) | 54-66 |
Numero di pagine | 13 |
Rivista | Theoretical Computer Science |
Volume | 664 |
Stato di pubblicazione | Published - 2017 |
All Science Journal Classification (ASJC) codes
- ???subjectarea.asjc.2600.2614???
- ???subjectarea.asjc.1700.1700???