On the exhaustive generation of k-convex polyominoes

Giuseppa Castiglione, Stefano Brocchi, Paolo Massazza

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)54-66
Number of pages13
JournalTheoretical Computer Science
Volume664
Publication statusPublished - 2017

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'On the exhaustive generation of k-convex polyominoes'. Together they form a unique fingerprint.

Cite this