Polyhedral characterization of reversible hinged dissections
From MaRDI portal
Abstract: We prove that two polygons and have a reversible hinged dissection (a chain hinged dissection that reverses inside and outside boundaries when folding between and ) if and only if and are two noncrossing nets of a common polyhedron. Furthermore, monotone reversible hinged dissections (where all hinges rotate in the same direction when changing from to ) correspond exactly to noncrossing nets of a common convex polyhedron. By envelope/parcel magic, it becomes easy to design many hinged dissections.
Recommendations
Cites work
- A criterion for a pair of convex polygons to be reversible
- A survey and recent results about commmon developments of two or more boxes
- Geometric folding algorithms. Linkages, origami, polyhedra
- Hinged dissections exist
- scientific article; zbMATH DE number 3160754 (Why is no real title available?)
- scientific article; zbMATH DE number 1229395 (Why is no real title available?)
- scientific article; zbMATH DE number 1507291 (Why is no real title available?)
- scientific article; zbMATH DE number 1789347 (Why is no real title available?)
- Reversible Nets of Polyhedra
Cited in
(11)- A prettier shell on the seashore: the Conway criterion
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
- Hinged dissection of polyominoes and polyforms
- Reversible Nets of Polyhedra
- scientific article; zbMATH DE number 1786506 (Why is no real title available?)
- On reversibility among parallelohedra
- Algorithms and Data Structures
- Hinged dissections exist
- Hinged dissections exist
- Unveil the secret hidden in the Haberdasher's puzzle. Survey on reversibility
- A decision algorithm for reversible pairs of polygons
This page was built for publication: Polyhedral characterization of reversible hinged dissections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2308491)