Abstract
Three open problems on folding/unfolding are discussed: (1) Can every convex polyhedron be cut along edges and unfolded flat to a single nonoverlapping piece? (2) Given gluing instructions for a polygon, construct the unique 3D convex polyhedron to which it folds. (3) Can every planar polygonal chain be straightened?
Cite
CITATION STYLE
APA
O’Rourke, J. (2000). Folding and unfolding in computational geometry. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1763, pp. 258–266). Springer Verlag. https://doi.org/10.1007/978-3-540-46515-7_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free