Minimum boundary touching tilings of polyominoes

DOI10.1002/MALQ.200510015zbMATH Open1089.68133OpenAlexW1977537695MaRDI QIDQ3376538FDOQ3376538

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

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

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)

Cites Work

• Algorithm Theory - SWAT 2004

Cited In (7)

• How to Tile by Dominoes the Boundary of a Polycube
• Optimal Partial Tiling of Manhattan Polyominoes
• Tiling with Monotone Polyominos
• Title not available (Why is that?)
• Perimeter-minimizing pentagonal tilings
• On Minimal Tilings with Convex Cells Each Containing a Unit Ball
• Coloring and boundary invariants for 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)