On computing the degree of convexity of polyominoes

zbMath1305.05045MaRDI QIDQ490307

Giuseppa Castiglione, Stefano Brocchi, Paolo Massazza

Publication date: 22 January 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p7

zbMATH Keywords

convex polyominoes; degree of convexity

Mathematics Subject Classification ID

68W40: Analysis of algorithms

52A37: Other problems of combinatorial convexity

05B50: Polyominoes

Related Items

On the exhaustive generation of \(k\)-convex polyominoes, Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses

Uses Software

• PCIF

Cites Work

• Counting \(k\)-convex polyominoes
• Algebraic languages and polyominoes enumeration
• Detection of the discrete convexity of polyominoes
• On the generation and enumeration of some classes of convex polyominoes
• A method for the enumeration of various classes of column-convex polygons
• A tiling system for the class of \(L\)-convex polyominoes
• On the generation of convex polyominoes
• Combinatorial aspects of \(L\)-convex polyominoes
• The number of Z-convex polyominoes
• A reconstruction algorithm for L-convex polyominoes.
• Reconstruction of L-convex Polyominoes
• PCIF: An Algorithm for Lossless True Color Image Compression
• Discrete Geometry for Computer Imagery
• Checker Boards and Polyominoes