TL;DR
This paper discusses the open problem in computational geometry regarding whether every pair of equal-area polygons can be dissected into each other using hinged pieces, highlighting unresolved questions in the field.
Contribution
It addresses the longstanding open problem of hinged dissections for equal-area polygons, providing insights into the challenges and current status of this question.
Findings
Highlights the open problem in hinged dissections
Discusses known results and challenges
Identifies key questions for future research
Abstract
The open problem of whether or not every pair of equal-area polygons has a hinged dissection is discussed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.