Algorithms for polyominoes based on the discrete Green theorem

DOI10.1016/J.DAM.2004.09.011MaRDI QIDQ1775619zbMATH OpenOpenAlexFDO

Authors Srečko Brlek, Gilbert Labelle, Annie Lacasse

Publication date 4 May 2005

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2004.09.011

zbMATH Keywords

AlgorithmsDiscrete Green theoremStatistics about polyominoes

Mathematics Subject Classification ID

Polyominoes (05B50) Combinatorics in computer science (68R05)

Recommendations

• Incremental algorithms based on discrete Green theorem.
• The discrete Green theorem and some applications in discrete geometry
• Generating convex polyominoes at random
• Minimal-perimeter polyominoes: chains, roots, and algorithms
• On the generation of 2-polyominoes

Cites work

• Enumeriation of parallelogram polyominoes with given bond and site perimeter
• scientific article; zbMATH DE number 3750972 (Why is no real title available?)
• Incremental algorithms based on discrete Green theorem.
• New enumerative results on two-dimensional directed animals
• Polyominoes defined by two vectors
• Reconstructing convex polyominoes from horizontal and vertical projections
• Salient and Reentrant Points of Discrete Sets

Cited in

(6)

• The discrete Green theorem and some applications in discrete geometry
• Efficient operations on discrete paths
• Code for polyomino and computer search of isospectral polyominoes
• Combinatorial View of Digital Convexity
• Incremental algorithms based on discrete Green theorem.
• Enumeration of polyominoes inscribed in a rectangle

This page was built for publication: Algorithms for polyominoes based on the discrete Green theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1775619)