Grid vertex-unfolding orthogonal polyhedra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3884 LNCS, Issue , 2006, Pages 264-276

  Damian, Mirela ^a   Flatland, Robin ^b   O'Rourke, Joseph ^c  

^a VILLANOVA UNIVERSITY   (United States)

^b SIENA COLLEGE   (United States)

^c SMITH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS;

ORTHOGONAL POLYHEDRA; VERTEX-UNFOLDING; VERTEX-UNFOLDING ALGORITHM; VERTEX-UNFOLDING ORTHOGONAL POLYHEDRA;

COMPUTATIONAL GEOMETRY;

EID: 33745609208     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11672142_21     Document Type: Conference Paper

References (7)

1. +98] T. Biedl, E. Demaine, M. Demaine, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, and S. Whitesides. Unfolding some classes of orthogonal polyhedra. In Proc. 10th Canad. Conf. Comput. Geom., pages 70-71, 1998.
2. +03] E. D. Demaine, D. Eppstein, J. Erickson, G. W. Hart, and J. O'Rourke. Vertex-unfoldings of simplicial manifolds. In Andras Bezdek, editor, Discrete Geometry, pages 215-228. Marcel Dekker, 2003.
3. Preliminary version appeared in 18th ACM Symposium on Computational Geometry, Barcelona, June 2002, pp. 237-243.
4. [DIL04] E. D. Demaine, J. Iacono, and S. Langerman. Grid vertex-unfolding of orthostacks. In Proc. Japan Conf. Discrete Comp. Geom., November 2004. To appear in LNCS, 2005.
5. [DO04] E. D. Demaine and J. O'Rourke. Open problems from CCCG 2004. In Proc. 16th Canad. Conf. Comput. Geom., 2004.
6. [DO05] E. D. Demaine and J. O'Rourke. A survey of folding and unfolding in computational geometry. In J. E. Goodman, J. Pach, and E. Welzl, editors, Combinatorial and Computational Geometry. Cambridge Univ. Press, 2005.
7. [PY92] M. S. Paterson and F. F. Yao. Optimal binary space partitions for orthogonal objects. J. Algorithms, 13: 99-113, 1992.