JCDCG 2004: Discrete and Computational Geometry pp 76-82 | Cite as
Grid Vertex-Unfolding Orthostacks
Conference paper
Abstract
An algorithm was presented in [BDD + 98] for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. It was 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.
Keywords
Computational Geometry Middle Phase Polyhedral Complex Planar Slice Polyhedron Vertex
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- [BDD+98]Biedl, T., Demaine, E., Demaine, M., Lubiw, A., Overmars, M., O’Rourke, J., Robbins, S., Whitesides, S.: Unfolding some classes of orthogonal polyhedra. In: Proceedings of the 10th Canadian Conference on Computational Geometry, Montréal, Canada (August 1998), http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-biedl-unfolding.ps.gz
- [DEE+02]Demaine, E.D., Eppstein, D., Erickson, J., Hart, G.W., O’Rourke, J.: Vertex-unfolding of simplicial manifolds. In: Proceedings of the 18th Annual ACM Symposium on Computational Geometry, Barcelona, Spain, June 2002, pp. 237–243 (2002)Google Scholar
- [DEE+03]Demaine, E.D., Eppstein, D., Erickson, J., Hart, G.W., O’Rourke, J.: Vertex-unfolding of simplicial manifolds. In: Discrete Geometry: In Honor of W. Kuperberg’s 60th Birthday, pp. 215–228. Marcer Dekker Inc., New York (2003)Google Scholar
- [Dem00]Demaine, E.D.: Folding and unfolding linkages, paper, and polyhedra. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 2000. LNCS, vol. 2098, pp. 113–124. Springer, Heidelberg (2001)CrossRefGoogle Scholar
- [DO05]Demaine, E.D., O’Rourke, J.: A survey of folding and unfolding in computational geometry. In: Goodman, J.E., Pach, J., Welzl, E. (eds.) Discrete and Computational Geometry. Mathematical Sciences Research Institute Publications, Cambridge University Press, Cambridge (2005) (to appear)Google Scholar
- [O’R98]O’Rourke, J.: Folding and unfolding in computational geometry. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol. 1763, pp. 258–266. Springer, Heidelberg (2000)CrossRefGoogle Scholar
- [She75]Shephard, G.C.: Convex polytopes with convex nets. Mathematical Proceedings of the Cambridge Philosophical Society 78, 389–403 (1975)MATHCrossRefMathSciNetGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2005