Hinged dissection of polyominoes and polyforms

DOI10.1016/J.COMGEO.2004.12.008zbMATH Open1072.52015arXivcs/9907018OpenAlexW2145153585MaRDI QIDQ2486086FDOQ2486086

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)

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.

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

Recommendations

• Hinged dissections exist
• Hinged dissections exist
• Algorithms and Data Structures
• A problem on hinged dissections with colours
• Polyhedral characterization of reversible hinged dissections

zbMATH Keywords

foldingreconfigurationdissectionequidecomposabilityhinging

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Efficient regular polygon dissections
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Economical triangle-square dissection
• Title not available (Why is that?)
• Hinged dissection of polyominoes and polyforms

Cited In (12)

• A problem on hinged dissections with colours
• Computational Geometry Column 44
• Hinged dissection of polyominoes and polyforms
• Hinged dissections exist
• Hinged dissections exist
• Algorithms and Data Structures
• Reversible Nets of Polyhedra
• Locked and unlocked chains of planar shapes
• Polyomino dissections
• Folding polyominoes from one level to two
• On the multiplicity of polyabolos and tangrams with four-fold symmetry
• Fun with fonts: algorithmic typography

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)