Abstract
Biedl et al.1 presented an algorithm for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. They conjectured that orthostacks could be unfolded using cuts that lie in a plane orthogonal to a coordinate axis and containing a vertex of the orthostack. We prove the existence of a vertex unfolding using only such cuts.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 245-254 |
| Number of pages | 10 |
| Journal | International Journal of Computational Geometry and Applications |
| Volume | 20 |
| Issue number | 3 |
| DOIs | |
| State | Published - Jun 2010 |
Fingerprint
Keywords
- cutting
- Edge unfolding
- folding
- orthogonal polyhedra
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Applied Mathematics
- Computational Mathematics
- Geometry and Topology
- Theoretical Computer Science
Cite this
Grid vertex-unfolding orthostacks. / Demaine, Erik D.; Iacono, John; Langerman, Stefan.
In: International Journal of Computational Geometry and Applications, Vol. 20, No. 3, 06.2010, p. 245-254.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Grid vertex-unfolding orthostacks
AU - Demaine, Erik D.
AU - Iacono, John
AU - Langerman, Stefan
PY - 2010/6
Y1 - 2010/6
N2 - Biedl et al.1 presented an algorithm for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. They conjectured that orthostacks could be unfolded using cuts that lie in a plane orthogonal to a coordinate axis and containing a vertex of the orthostack. We prove the existence of a vertex unfolding using only such cuts.
AB - Biedl et al.1 presented an algorithm for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. They conjectured that orthostacks could be unfolded using cuts that lie in a plane orthogonal to a coordinate axis and containing a vertex of the orthostack. We prove the existence of a vertex unfolding using only such cuts.
KW - cutting
KW - Edge unfolding
KW - folding
KW - orthogonal polyhedra
UR - http://www.scopus.com/inward/record.url?scp=77954325911&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77954325911&partnerID=8YFLogxK
U2 - 10.1142/S0218195910003281
DO - 10.1142/S0218195910003281
M3 - Article
VL - 20
SP - 245
EP - 254
JO - International Journal of Computational Geometry and Applications
JF - International Journal of Computational Geometry and Applications
SN - 0218-1959
IS - 3
ER -