Convex Polygons that Cannot Tile the Plane

DOI10.2307/2320624MaRDI QIDQ4188370zbMATH OpenOpenAlexFDO

Authors I. Niven

Publication date 1978

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2320624

zbMATH Keywords

Convex Polygons That Cannot Tile Plane

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Convex sets in (2) dimensions (including convex curves) (52A10)

Cited in

(11)

• Tiling complexity of small n-ominoes \((N<10)\)
• Convex pentagons that admit \(i\)-block transitive tilings
• On the number of non-hexagons in a planar tiling
• The theorems of Euler and Eberhard for tilings of the plane
• Concrete polytopes may not tile the space
• Balanced triangulations
• Acute triangulations of polyhedra and \(\mathbb R^N\)
• Dudeney Transformation of Normal Tiles
• Multifold tiles of polyominoes and convex lattice polygons
• Mathematics in ``Babel's library
• The existence on non-tiles and non-facets in three dimensions

This page was built for publication: Convex Polygons that Cannot Tile the Plane

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