Folding equilateral plane graphs
22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings
Main Authors: | Abel, Zachary Ryan (Contributor), Demaine, Erik D. (Contributor), Demaine, Martin L. (Contributor), Eisenstat, Sarah Charmian (Contributor), Lynch, Jayson R. (Contributor), Schardl, Tao Benjamin (Contributor), Shapiro-Ellowitz, Isaac (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Department of Mathematics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer Berlin / Heidelberg,
2012-10-10T16:16:21Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Folding equilateral plane graphs
by: Abel, Zachary R., et al.
Published: (2020) -
Who Needs Crossings? Hardness of Plane Graph Rigidity
by: Abel, Zachary R, et al.
Published: (2017) -
Finding a Hamiltonian Path in a Cube with Specified Turns is Hard
by: Abel, Zachary Ryan, et al.
Published: (2014) -
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
by: Demaine, Erik D., et al.
Published: (2015) -
Flattening fixed-angle chains is strongly NP-hard
by: Demaine, Erik D., et al.
Published: (2012)