Erik D Demaine
Biographic Data
| ID | 10814265 |
|---|---|
| NAME | Erik D Demaine |
| GIVEN NAMES | Erik D |
| FAMILY NAME | Demaine |
| SIGNATURE | DEMAINE E D |
| AFFILIATIONS | Massachusetts Institute of Technology |
| ORCID | 0000-0003-3803-5703 |
| VERIFIED | No |
| TOTAL WORKS | 2 |
| TOTAL CITATIONS | 0 |
| WORKS AS AUTHOR | 2 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2003 |
| LATEST PUBLICATION YEAR | 2022 |
| H-INDEX | 0 |
Combinatorial Game Theory
Vertex-Unfoldings of Simplicial Manifolds
We present an algorithm to unfold any triangulated 2-manifold (in particular, any simplicial polyhedron) into a non-overlapping, connected planar layout in linear time.The manifold is cut only along its edges.The resulting layout is connected, but it may have a disconnected interior; the triangles are connected at vertices, but not necessarily joined along edges.We extend our algorithm to establish a similar result for simplicial manifolds of arb…
No prominent works on this page.
Vertex-Unfoldings of Simplicial Manifolds
We present an algorithm to unfold any triangulated 2-manifold (in particular, any simplicial polyhedron) into a non-overlapping, connected planar layout in linear time.The manifold is cut only along its edges.The resulting layout is connected, but it may have a disconnected interior; the triangles are connected at vertices, but not necessarily joined along edges.We extend our algorithm to establish a similar result for simplicial manifolds of arb…
Combinatorial Game Theory
Advanced Graph Theory Research (2 works) · Mathematics (2 works) · Artificial Intelligence in Games (1 work) · Combinatorics (1 work) · Computational Geometry and Mesh Generation (1 work) · Computer Science (1 work) · Dimension (graph theory) (1 work) · Engineering (1 work) · Game theory (1 work) · Game Theory and Applications (1 work)