Zobrazeno 1 - 10
of 457
pro vyhledávání: '"Erik D. Demaine"'
Autor:
Jana Dambrogio, Amanda Ghassaei, Daniel Starza Smith, Holly Jackson, Martin L. Demaine, Graham Davis, David Mills, Rebekah Ahrendt, Nadine Akkerman, David van der Linden, Erik D. Demaine
Publikováno v:
Nature Communications, Vol 12, Iss 1, Pp 1-10 (2021)
Here, the authors present a fully automatic computational approach for reconstructing and virtually unfolding volumetric scans of locked letters with complex internal folding, producing legible images of the letter’s contents and crease pattern whi
Externí odkaz:
https://doaj.org/article/0ce33d5eba684710baf3433246744129
Autor:
Zachary Abel, Jason Cantarella, Erik D. Demaine, David Eppstein, Thomas C. Hull, Jason S. Ku, Robert J. Lang, Tomohiro Tachi
Publikováno v:
Journal of Computational Geometry, Vol 7, Iss 1 (2016)
We develop an intrinsic necessary and sufficient condition for single-vertex origami crease patterns to be able to fold rigidly. We classify such patterns in the case where the creases are pre-assigned to be mountains and valleys as well as in the un
Externí odkaz:
https://doaj.org/article/1dff2b3cabbe4305ad11e713939c418d
Publikováno v:
Algorithms, Vol 5, Iss 1, Pp 148-157 (2012)
Suppose there is a collection of n simple polygons in the plane, none of which overlap each other. The polygons are interlocked if no subset can be separated arbitrarily far from the rest. It is natural to ask the characterization of the subsets that
Externí odkaz:
https://doaj.org/article/35ab6a88aeb0459a89c91ad658a3167a
Autor:
Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow
Publikováno v:
Journal of Computational Geometry, Vol 5, Iss 1 (2014)
Can folding a piece of paper flat make it larger? We explore whether a shape S must be scaled to cover a flat-folded copy of itself. We consider both single folds and arbitrary folds (continuous piecewise isometries \(S\to\mathbb{R}^2\)). The underly
Externí odkaz:
https://doaj.org/article/4aa7d08e90f144ac8e4b7f8071cb1d8a
Autor:
Erik D. Demaine, Joseph O'Rourke
Did you know that any straight-line drawing on paper can be folded so that the complete drawing can be cut out with one straight scissors cut? That there is a planar linkage that can trace out any algebraic curve, or even'sign your name'? Or that a'L
Autor:
Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
Publikováno v:
Computational Geometry. 113:101995
Autor:
Martin L. Demaine, Robert T. Schweller, David Furcy, Scott M. Summers, Erik D. Demaine, Matthew J. Patitz, Andrew Winslow, Sarah Eisenstat, Sarah Cannon
Publikováno v:
Theoretical Computer Science. 894:50-78
In this paper we present a series of results which show separations between the standard seeded model of self-assembly, Winfree's abstract Tile Assembly Model (aTAM), and the “seedless” 2-Handed Assembly Model (2HAM), which incorporates the dynam
Publikováno v:
Lecture Notes on Data Engineering and Communications Technologies ISBN: 9783031135873
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf26c11d2d713256a781b1e5ee0e00e1
https://doi.org/10.1007/978-3-031-13588-0_16
https://doi.org/10.1007/978-3-031-13588-0_16
Publikováno v:
Springer US
In this paper, we study online algorithms for the Canadian Traveller Problem defined by Papadimitriou and Yannakakis in 1991. This problem involves a traveller who knows the entire road network in advance, and wishes to travel as quickly as possible