On computing the degree of convexity of polyominoes
- Authors: Brocchi, S.; Castiglione, G.; Massazza, P.
- Publication year: 2015
- Type: Articolo in rivista (Articolo in rivista)
- OA Link: http://hdl.handle.net/10447/138112
In this paper we present an algorithm which has as input a convex polyomino P and computes its degree of convexity, deﬁned as 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. The algorithm uses space O(m + n) to represent a polyomino P with n rows and m columns, and has time complexity O(min(m, rk)), where r is the number of corners of P. Moreover, the algorithm leads naturally to a decomposition of P into simpler polyominoes.