A criterion for a pair of convex polygons to be reversible (Q2345508)

The classic problem of dissecting an equilateral triangle so that the pieces can be reassembled to form a square was proposed at the beginning of the 20th century. It is the most famous of the geometrical discoveries made by Henry Dudeney. Other dissection problems can be found in [\textit{G. N. Frederickson}, Dissections: plane and fancy. Cambridge: Cambridge University Press (1997; Zbl 0939.52008)], for instance. A pair of convex polygons \(\alpha\) and \(\beta\) (with the same area) is said to be reversible if \(\alpha\) has a dissection into a finite number of hinged pieces which can be rearranged to form \(\beta\) (under certain additional conditions). The authors present a necessary and sufficient condition for a given pair of convex polygons \(\alpha\), \(\beta\) to be reversible. Geometrical arguments are also given.