Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement
We show that every orthogonal polyhedron of genus g≤2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron edges). This is the first result on unfolding general orthogonal polyhedra beyond genus-0. Our unfolding algorithm relies on the exist...
| Main Authors: | , , , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Springer Japan,
2018-06-12T14:49:08Z.
|
| Subjects: | |
| Online Access: | Get fulltext |