Minimum boundary touching tilings of polyominoes

DOI10.1002/MALQ.200510015MaRDI QIDQ3376538zbMATH OpenOpenAlexFDO

Authors Andreas Spillner

Publication date 24 March 2006

Published in MLQ (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200510015

zbMATH Keywords

computational complexityalgorithmcomputational geometrypolyominodecision problemsquare tiling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)

Recommendations

• An algorithm for deciding if a polyomino tiles the plane
• An optimal algorithm for tiling the plane with a translated polyomino
• scientific article; zbMATH DE number 1256699
• scientific article; zbMATH DE number 3906514
• Tiling figures of the plane with two bars

Cites work

• Algorithm Theory - SWAT 2004

Cited in

(7)

• scientific article; zbMATH DE number 7618199 (Why is no real title available?)
• Coloring and boundary invariants for polyominoes
• Perimeter-minimizing pentagonal tilings
• Tiling with Monotone Polyominos
• How to Tile by Dominoes the Boundary of a Polycube
• On Minimal Tilings with Convex Cells Each Containing a Unit Ball
• Optimal Partial Tiling of Manhattan Polyominoes

This page was built for publication: Minimum boundary touching tilings of polyominoes

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