The foldings of a square to convex polyhedra

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

Volumn 2866, Issue , 2003, Pages 38-50

  Alexander, Rebecca ^a   Dyson, Heather ^a   O'Rourke, Joseph ^a  

^a SMITH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY;

CONVEX POLYHEDRONS; FOLDINGS; NONDEGENERATE;

GEOMETRY;

EID: 33645400758     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-44400-8_5     Document Type: Article

References (10)

1. Aleksandrov, A.D.: Konvexe Polyeder. Akademie Verlag, Berlin (1958)
2. Lubiw, A., O'Rourke, J.: When can a polygon fold to a polytope? Technical Report 048, Dept. Comput. Sci., Smith College (1996)
3. Presented at AMS Conf., 5 Oct. 1996.
4. Demaine, E.D., Demaine, M.L., Lubiw, A., O'Rourke, J.: Examples, counterexamples, and enumeration results for foldings and unfoldings between polygons and polytopes. Technical Report 069, Smith College, Northampton, MA (2000) LANL ArXive cs.CG/0007019.
5. Demaine, E.D., Demaine, M.L., Lubiw, A., O'Rourke, J.: Enumerating foldings and unfoldings between polygons and polytopes. Graphs and Combinatorics 18 (2002) 93-104
6. O'Rourke, J.: Folding and unfolding in computational geometry. In: Discrete Comput. Geom. Volume 1763 of Lecture Notes Comput. Sci., Springer-Verlag (2000) 258-266
7. Papers from the Japan Conf. Discrete Comput. Geom., Tokyo, Dec. 1998.
8. Shephard, G.C.: Convex polytopes with convex nets. Math. Proc. Camb. Phil. Soc. 78 (1975) 389-403
9. Aleksandrov, A.D.: Existence of a convex polyhedron and a convex surface with a given metric. In Reshetnyak, Y.G., Kutateladze, S.S., eds.: A. D. Aleksandrov: Selected Works: Part I. Gordon and Breach, Australia (1996) 169-173.
10. Translation of Doklady Akad. Nauk SSSR, Matematika, Vol. 30, No. 2, 103-106 (1941).