Hinged dissection of polyominoes and polyforms

DOI10.1016/J.COMGEO.2004.12.008MaRDI QIDQ2486086zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman

Publication date 5 August 2005

Published in Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

folding reconfiguration dissection equidecomposability hinging

Mathematics Subject Classification ID

Polyominoes (05B50) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Abstract: A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection of all edge-to-edge gluings of n congruent copies of a polygon P that join corresponding edges of P. This construction uses kn pieces, where k is the number of vertices of P. When P is a regular polygon, we show how to reduce the number of pieces to ceiling(k/2)*(n-1). In particular, we consider polyominoes (made up of unit squares), polyiamonds (made up of equilateral triangles), and polyhexes (made up of regular hexagons). We also give a hinged dissection of all polyabolos (made up of right isosceles triangles), which do not fall under the general result mentioned above. Finally, we show that if P can be hinged into Q, then any edge-to-edge gluing of n congruent copies of P can be hinged into any edge-to-edge gluing of n congruent copies of Q.

Recommendations

Cites work

Cited in

(12)

This page was built for publication: Hinged dissection of polyominoes and polyforms

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