Deciding multiple tiling by polygons in polynomial time

DOI10.1007/s10998-020-00361-yzbMath1488.52027arXiv1912.01904OpenAlexW3092651939MaRDI QIDQ2043725

Mihail N. Kolountzakis

Publication date: 3 August 2021

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.01904

zbMATH Keywords

algorithmsdiscrete subgroupslatticescentrally symmetric convex polygontiling by translations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Lattice packing and covering (number-theoretic aspects) (11H31) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)

Related Items (1)

Periodic structure of translational multi-tilings in the plane

Cites Work

• Structure results for multiple tilings in 3D
• On the structure of multiple translational tilings by polygonal regions
• Translational tilings by a polytope, with multiplicity
• Modern Computer Algebra
• Multi‐tiling and equidecomposability of polytopes by lattice translates

This page was built for publication: Deciding multiple tiling by polygons in polynomial time