暂无分享,去创建一个
It is shown that every orthogonal terrain, i.e., an orthogonal (right-angled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its surface may be unfolded to a single non-overlapping piece by cutting along grid edges defined by coordinate planes through every vertex.
[1] Erik D. Demaine,et al. Open problems from cccg 2001 , 2001, CCCG.
[2] J. O'Rourke,et al. Geometric Folding Algorithms: Linkages , 2007 .
[3] Joseph O'Rourke,et al. Unfolding Manhattan Towers , 2005, CCCG.
[4] Erik D. Demaine,et al. Unfolding some classes of orthogonal polyhedra , 1998, CCCG.
[5] Erik D. Demaine,et al. Geometric folding algorithms - linkages, origami, polyhedra , 2007 .