Paper by Erik D. Demaine

Reference:
Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, and Scott Duke Kominers, “Hinged Dissections Exist”, Discrete & Computational Geometry, volume 47, number 1, 2012, pages 150–186.

Abstract:
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously without self-intersection to form any polygon in the collection. This result settles the open problem about the existence of hinged dissections between pairs of polygons that goes back implicitly to 1864 and has been studied extensively in the past ten years. Our result generalizes and indeed builds upon the result from 1814 that polygons have common dissections (without hinges). Our proofs are constructive, giving explicit algorithms in all cases. For two planar polygons whose vertices lie on a rational grid, both the number of pieces and the running time required by our construction are pseudopolynomial. This bound is the best possible, even for unhinged dissections. Hinged dissections have possible applications to reconfigurable robotics, programmable matter, and nanomanufacturing.

Comments:
This paper is also available from SpringerLink.

Length:
The paper is 33 pages.

Availability:
The paper is available in PostScript (2058k), gzipped PostScript (770k), and PDF (648k).
See information on file formats.
[Google Scholar search]

Related papers:
HingedDissections_SoCG2008 (Hinged Dissections Exist)


See also other papers by Erik Demaine.
These pages are generated automagically from a BibTeX file.
Last updated September 25, 2017 by Erik Demaine.