A decision algorithm for reversible pairs of polygons

DOI10.1016/J.DAM.2014.06.015MaRDI QIDQ741530zbMATH OpenOpenAlexFDO

Authors Jin Akiyama, Hyunwoo Seong, David Rappaport

Publication date 12 September 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2014.06.015

zbMATH Keywords

decision algorithmequi-decomposabilityparallelogramreversibilityreversion trunktiling

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Dissections and valuations (Hilbert's third problem, etc.) (52B45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A criterion for a pair of convex polygons to be reversible
• Operators which Preserve Reversibility
• \((1+n)\) sequential dissection of a rectangle into \(m\)-gons, \(m\in \{ 3,5,6,7,8 \}\)
• On reversibility among parallelohedra
• Polyhedral characterization of reversible hinged dissections

Cites work

• scientific article; zbMATH DE number 1335472 (Why is no real title available?)
• scientific article; zbMATH DE number 1789347 (Why is no real title available?)
• scientific article; zbMATH DE number 2209710 (Why is no real title available?)
• Properties of nodes in pentagonal tilings

Cited in

(6)

• A criterion for a pair of convex polygons to be reversible
• Reversibility and foldability of Conway tiles
• Generalization of Haberdasher's puzzle
• Reversible Nets of Polyhedra
• ON THE MATABILITY OF POLYGONS
• On reversibility among parallelohedra

This page was built for publication: A decision algorithm for reversible pairs of polygons

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