Algorithms for polyominoes based on the discrete Green theorem

DOI10.1016/j.dam.2004.09.011zbMath1068.68096OpenAlexW2092316005MaRDI QIDQ1775619

Gilbert Labelle, Annie Lacasse, Srečko Brlek

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

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

Related Items (3)

Efficient operations on discrete paths ⋮ Enumeration of polyominoes inscribed in a rectangle ⋮ Combinatorial View of Digital Convexity

Cites Work

• Unnamed Item
• Reconstructing convex polyominoes from horizontal and vertical projections
• Enumeriation of parallelogram polyominoes with given bond and site perimeter
• Polyominoes defined by two vectors
• New enumerative results on two-dimensional directed animals
• Salient and Reentrant Points of Discrete Sets
• Discrete Geometry for Computer Imagery

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