| Presentation | 2011-05-11 Edge-Unfoldings of Platonic Solids Never Overlap Takashi HORIYAMA, Wataru SHOJI, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We solve an open problem for hundreds of years: Is every edge-unfolding of Platonic solids nonoverlapping? The answer is yes. In other words, if we unfold Platonic solids by cutting along their edges, we can always obtain a flat nonoverlapping simple polygon. (This article is a technical report without peer review.) |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Unfolding / Platonic solids / Enumeration algorithms / Binary decision diagrams |
| Paper # | COMP2011-14 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2011/5/4(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Edge-Unfoldings of Platonic Solids Never Overlap |
| Sub Title (in English) | |
| Keyword(1) | Unfolding |
| Keyword(2) | Platonic solids |
| Keyword(3) | Enumeration algorithms |
| Keyword(4) | Binary decision diagrams |
| 1st Author's Name | Takashi HORIYAMA |
| 1st Author's Affiliation | Graduate School of Science and Engineering, Saitama University() |
| 2nd Author's Name | Wataru SHOJI |
| 2nd Author's Affiliation | Graduate School of Science and Engineering, Saitama University |
| Date | 2011-05-11 |
| Paper # | COMP2011-14 |
| Volume (vol) | vol.111 |
| Number (no) | 25 |
| Page | pp.pp.- |
| #Pages | 7 |
| Date of Issue | |