Abstract
A given pair of convex polygons α and β is said to be reversible if α has a dissection into a finite number of pieces which can be rearranged to form β under some conditions. In this paper, we give an algorithm to decide whether or not a given pair of polygons α and β is reversible. Furthermore, a method of how to dissect α to make β, when they are reversible, is also given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
