Tiling a polygon with parallelograms

DOI10.1007/BF01228510zbMath0778.52012OpenAlexW2018748348MaRDI QIDQ2366227

Richard W. Kenyon

Publication date: 29 June 1993

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01228510

zbMATH Keywords

computational geometrysimple polygonquadratic time algorithmtiling by parallelograms

Mathematics Subject Classification ID

Related Items (23)

Sub Rosa, a system of quasiperiodic rhombic substitution tilings with \(n\)-fold rotational symmetry ⋮ A zonotope and a product of two simplices with disconnected flip graphs ⋮ The multidimensional cube recurrence ⋮ Rhombus tilings of an even-sided polygon and quadrangulations on the projective plane ⋮ Construction of \(C^1\) polygonal splines over quadrilateral partitions ⋮ The domino problem is undecidable on every rhombus subshift ⋮ Critical varieties in the Grassmannian ⋮ Substitution discrete plane tilings with \(2n\)-fold rotational symmetry for odd \(n\) ⋮ Distances on rhombus tilings ⋮ Parallelogram tilings, worms, and finite orientations ⋮ Tiling polygons with parallelograms ⋮ A characterization of flip-accessibility for rhombus tilings of the whole plane ⋮ Universality for the random-cluster model on isoradial graphs ⋮ The \(Z\)-invariant massive Laplacian on isoradial graphs ⋮ Integer Partitions, Tilings of2D-gons and Lattices ⋮ Y-equivalence and rhombic realization of projective-planar quadrangulations ⋮ Distances on Lozenge Tilings ⋮ Unnamed Item ⋮ A formula for boundary correlations of the critical Ising model ⋮ Cyclotomic aperiodic substitution tilings ⋮ Graph encoding of 2D-gon tilings ⋮ Random tilings of high symmetry. I: Mean-field theory ⋮ Random tilings of high symmetry. II: Boundary conditions and numerical studies

Cites Work

• Tiling polygons with parallelograms
• Conway's Tiling Groups
• The undecidability of the domino problem

This page was built for publication: Tiling a polygon with parallelograms