|
|
|
|
| LEADER |
01394 am a22002173u 4500 |
| 001 |
86067 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Damian, Mirela
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
|e contributor
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
| 100 |
1 |
0 |
|a Demaine, Erik D.
|e contributor
|
| 700 |
1 |
0 |
|a Demaine, Erik D.
|e author
|
| 700 |
1 |
0 |
|a Flatland, Robin
|e author
|
| 245 |
0 |
0 |
|a Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm
|
| 260 |
|
|
|b Springer-Verlag,
|c 2014-04-07T17:58:47Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/86067
|
| 520 |
|
|
|a We show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previous such result used exponentially many cuts. More precisely, given an orthogonal polyhedron with n vertices, the algorithm cuts the polyhedron only where it is met by the grid of coordinate planes passing through the vertices, together with Θ(n [superscript 2]) additional coordinate planes between every two such grid planes.
|
| 520 |
|
|
|a National Science Foundation (U.S.) (CAREER Award CCF-0347776)
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Graphs and Combinatorics
|
