A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino
From MaRDI portal
Publication:3132886
DOI10.4230/LIPIcs.SoCG.2016.50zbMath1387.68266arXiv1507.02762OpenAlexW2964109259MaRDI QIDQ3132886
Andrew Winslow, Stefan Langerman
Publication date: 30 January 2018
Full work available at URL: https://arxiv.org/abs/1507.02762
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Polyominoes (05B50)
Related Items (2)
This page was built for publication: A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino