Martin Demaine

Mr. Martin Demaine


Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2007 in Graphs and Combinatorics
Verified
Journal Article
Closed access
PDF file
EDErik D. Demaine
Erik D. Demaine
MDMartin Demaine
Martin Demaine

14 March 2008 in Natural Computing
Verified
Journal Article
Closed access
PDF file
EDErik D. Demaine
Erik D. Demaine
MDMartin Demaine
Martin Demaine
SFSándor P. Fekete
Sándor P. Fekete
MIMashhood Ishaque
Mashhood Ishaque
EREynat Rafalin
Eynat Rafalin
DSDiane L. Souvaine
Diane L. Souvaine

17 March 2011 in Graphs and Combinatorics
Verified
Journal Article
Open access
PDF file
EDErik D. Demaine
Erik D. Demaine
MDMartin Demaine
Martin Demaine
VHVi Hart
Vi Hart
GPGregory N. Price
Gregory N. Price
TTTomohiro Tachi
Tomohiro Tachi
We prove that the pleated hyperbolic paraboloid, a familiar origami model known since 1927, in fact cannot be folded with the standard crease pattern in the standard mathematical model of zero-thickness paper. In contrast, we show that the model can be folded with additional creases, suggesting that real paper “folds” into this model via small such creases. We conjecture that the circular version of this model, consisting simply of concentric circular creases, also folds without extra creases. At the heart of our results is a new structural theorem characterizing uncreased intrinsically flat surfaces—the portions of paper between the creases. Differential geometry has much to say about the local behavior of such surfaces when they are sufficiently smooth, e.g., that they are torsal ruled. But this classic result is simply false in the context of the whole surface. Our structural characterization tells the whole story, and even applies to surfaces with discontinuities in the second derivative. We use our theorem to prove fundamental properties about how paper folds, for example, that straight creases on the piece of paper must remain piecewise-straight (polygonal) by folding.

31 August 2003 in Computational Geometry
Verified
Journal Article
Closed access
EDErik D. Demaine
Erik D. Demaine
MDMartin Demaine
Martin Demaine
MHMichael Hoffmann
Michael Hoffmann
JOJoseph O'Rourke
Joseph O'Rourke

1 January 2014
Verified
Book Chapter
Closed access
PDF file
EDErik D. Demaine
Erik D. Demaine
MDMartin Demaine
Martin Demaine
SFSándor P. Fekete
Sándor P. Fekete
MPMatthew J. Patitz
Matthew J. Patitz
RSRobert T. Schweller
Robert T. Schweller
DWDamien Woods
Damien Woods

1 October 2011 in Discrete & Computational Geometry
Verified
Journal Article
Open access
PDF file
TATimothy G. Abbott
Timothy G. Abbott
ZAZachary Abel
Zachary Abel
DCDavid Charlton
David Charlton
EDErik D. Demaine
Erik D. Demaine
MDMartin Demaine
Martin Demaine
SKScott Duke Kominers
Scott Duke Kominers
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.