Computational Geometry Column 44

From MaRDI portal





It is well known that any two polygons \(P\) und \(Q\) of equal area are equidecomposable. This means that \(P\) and \(Q\) may be dissected into subpolygons \(P_{1},\dots ,P_{n}\) and \(Q_{1},\dots ,Q_{n}\) such that \(P_{i}\) is congruent to \(Q_{i}\) for each \(i\). The present paper, communicated by D.T. Lee, is a short survey on the open problem whether or not every pair of equal-area polygons is equidecomposable in the sense of a ``hinged dissection, which means that the polygons \(P_{i}\) are thought to be linked by hinges in such a way that the polygons \(Q_{i}\) are linked by the corresponding hinges. The paper reports in particular on some advances made in the last few years.











This page was built for publication: Computational Geometry Column 44

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