Timeline for What is known about polyhedra nets that allow overlapping?
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 4, 2010 at 23:17 | answer | added | Joseph O'Rourke | timeline score: 1 | |
| Jan 2, 2010 at 0:56 | history | edited | Ilya Nikokoshev |
edited tags
|
|
| Jan 2, 2010 at 0:34 | comment | added | Jason Dyer | Given this has been standing without an answer and may remain so for a while, I have added the open-problem tag. | |
| Jan 2, 2010 at 0:33 | history | edited | Jason Dyer |
edited tags
|
|
| Dec 13, 2009 at 22:32 | comment | added | Joseph Malkevitch | A very good source for problems and methods involving the folding of polygons to polyhedra and the cutting of edges (or using more general cuts) to "unfold" a polyhedron into the plane is the recent book of Erik Demaine and Joseph O'Rourke published by Cambridge U. Press, 2007. There are also lots of papers about unfolding and folding on the web pages of Demaine and O'Rourke. | |
| Dec 2, 2009 at 23:32 | history | edited | Ilya Nikokoshev |
retag
|
|
| Dec 2, 2009 at 17:05 | history | edited | Jason Dyer | CC BY-SA 2.5 |
Added details; deleted 4 characters in body
|
| Nov 27, 2009 at 17:30 | answer | added | Nurdin Takenov | timeline score: 3 | |
| Nov 24, 2009 at 15:31 | comment | added | Gil Kalai | Interesting question. I dont see much hope for a positive result for non convex polyhedra (even spherical). | |
| Nov 24, 2009 at 14:11 | history | asked | Jason Dyer | CC BY-SA 2.5 |