On computing the degree of convexity of polyominoes
zbMATH Open1305.05045MaRDI QIDQ490307FDOQ490307
G. Castiglione, Stefano Brocchi, P. 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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Analysis of algorithms (68W40) Polyominoes (05B50) Other problems of combinatorial convexity (52A37)
Cites Work
- PCIF: An Algorithm for Lossless True Color Image Compression
- Algebraic languages and polyominoes enumeration
- A method for the enumeration of various classes of column-convex polygons
- A tiling system for the class of \(L\)-convex polyominoes
- Combinatorial aspects of \(L\)-convex polyominoes
- Reconstruction of L-convex Polyominoes
- Discrete Geometry for Computer Imagery
- Checker Boards and Polyominoes
- The number of Z-convex polyominoes
- Counting \(k\)-convex polyominoes
- Detection of the discrete convexity of polyominoes
- On the generation and enumeration of some classes of convex polyominoes
- On the generation of convex polyominoes
- A reconstruction algorithm for L-convex polyominoes.
Cited In (6)
- Detection of the discrete convexity of polyominoes
- Computing deviations from convexity in polygons
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings
- Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses
- Code for polyomino and computer search of isospectral polyominoes
- On the exhaustive generation of \(k\)-convex polyominoes
Uses Software
This page was built for publication: On computing the degree of convexity of polyominoes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490307)
