Metamorphosis of the cube
暂无分享,去创建一个
The foldings and unfoldings shown in this video illustrate two problems: (1) cut open and unfold a convex polyhedron to a simple planar polygon; and (2) fold and glue a simple planar polygon into a convex polyhedron. A convex polyhedron can always be unfolded, at least when we allow cuts across the faces of the polyhedron. One such unfolding is the star unfolding [2]. When cuts are limited to the edges of the polyhedron, it is not known whether every convex polyhedron has an unfolding [3], although there is software that has never failed to produce an unfolding, e.g., HyperGami [6]. The problem of folding a polygon to form a convex polyhedron is partly answered by a powerful theorem of Aleksandrov. The following section describes this in more detail. After that, we explain the examples that are shown in the video, and discuss some open problems.
[1] Kenneth Falconer,et al. Unsolved Problems In Geometry , 1991 .
[2] J. O'Rourke,et al. When Can a Polygon Fold to a Polytope , 1999 .
[3] Boris Aronov,et al. Star Unfolding of a Polytope with Applications , 1997, SIAM J. Comput..
[4] Petery Cromwell. Dissections: plane and fancy , by Greg N. Frederickson. Pp. 310. £19.95. 1998. ISBN 0 521 57197 9 (Cambridge University Press). , 1997 .
[5] Joseph O'Rourke,et al. Folding and Unfolding in Computational Geometry , 1998, JCDCG.