Minimal-perimeter polyominoes: chains, roots, and algorithms

DOI10.1007/978-3-030-11509-8_10MaRDI QIDQ2326570zbMATH OpenOpenAlexFDO

Authors Gill Barequet, Gil Ben-Shachar

Publication date 10 October 2019

Full work available at URL https://doi.org/10.1007/978-3-030-11509-8_10

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Properties of minimal-perimeter polyominoes
• Enumerating polyominoes with fixed perimeter defect
• Automatic generation of formulae for polyominoes with a fixed perimeter defect
• Generating convex polyominoes at random
• Polyominoes with minimum site-perimeter and full set achievement games

Cited in

(12)

• Enumerating polyominoes with fixed perimeter defect
• Algorithms for polyominoes based on the discrete Green theorem
• Properties of minimal-perimeter polyominoes
• Automatic generation of formulae for polyominoes with a fixed perimeter defect
• Minimum-perimeter lattice animals and the constant-isomer conjecture
• scientific article; zbMATH DE number 91040 (Why is no real title available?)
• Enumeration of inscribed polyominos
• Properties of minimal-perimeter polyominoes (multimedia exposition)
• Incremental algorithms based on discrete Green theorem.
• Counting polyominoes, revisited
• Adding layers to bumped-body polyforms with minimum perimeter preserves minimum perim\-eter
• Polyiamonds and polyhexes with minimum site-perimeter and achievement games

This page was built for publication: Minimal-perimeter polyominoes: chains, roots, and algorithms

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