長久以來，辨識非凸多面體是否存在展開演算法是一個尚未解決的問題。在近年的研究中，專注於非凸多面體中的一類─「正交多面體」的展開，並提出了grid-edge以及grid-vertex展開演算法。然而有兩個前提，最後的面要再切割為n_1*n_2的方格且只能對虧格為零的正交多面體做展開。
所以在此篇論文中，我們使用了由單位立方體結合而成的網格式多面體取代原先的正交多面體，並對此圖形設計展開演算法。研究中的第一個主題是考慮網格式曼哈頓塔的邊展開演算法。主要的想法是利用帶狀的長條去攤平每一層上的表面，而且這些長條也被用做連接不同層的橋接器。第二個主題則是考慮含有形似單位立方體的洞，此類單層網格式多面體之邊展開演算法。主要的概念是找出一條路徑將所有的洞連結在一起，並讓最後展開的結果維持向右及向上延伸。在此論文中，我們提出了不需重新對表面切割的邊展開，也證明了虧格不為零的單層網格式多面體存在邊展開演算法。

It is a long-standing open problem to recognize whether every nonconvex polyhedron has a general unfolding algorithm. In the recent research, it is proposed grid-edge and grid-vertex unfolding algorithms to solve orthogonal polyhedron which is one class of nonconvex polyhedra. Since there are two fundamentals, the separated surface must have a refinement to be divided into n_1*n_2 grid and the orthogonal polyhedron is genus-zero.

The aim of this thesis is to consider the unfolding algorithms run on the lattice polyhedra formed by unit cubes. The first research topic is the edge-unfolding algorithm for lattice Manhattan Towers. The main idea is to use many strips to flatten the faces of each layer and these strips are regarded as the bridge between two bands. The second research is to consider the edge-unfolding algorithm for one-layer lattice polyhedra with cubic holes. The principal concept is finding the connected bridge to link the holes and let the extending direction keep in rightward or upward direction. We propose the algorithms which are 1*1 edge-unfolding without refining grid size. It is also shown that there exists unfolding methods to flatten one-layer lattice polyhedra with genus >1 and monotone boundary.

Bibliography
[1] Zachary Abel and Erik D. Demaine. Edge-unfolding orthogonal polyhedra is strongly np-complete. In Proceedings of the 23rd Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, 2011.
[2] Aleksandr D. Alexandrov. Vupyklue mnogogranniki. Gosydarstvennoe Izdatelstvo
Tehno-Teoreticheskoi Literaturu, 1950. In Russian. See [2] for English translation.
[3] Aleksandr D. Alexandrov. Convex polyhedra. Monographs in Mathematics, 2005. Translation of the 1950 Russian edition by N. S. Dairbekov, S. S. Kutateladze, and A. B.Sossinsky.
[4] Greg Aloupis, Prosenjit K. Bose, Sebastien Collette, Erik D. Demaine, Martin L. De-
maine, Karim Douieb, Vida Dujmovic, John Iacono, Stefan Langerman, and Pat Morin. Common unfoldings of polyominoes and polycube. In Abstracts from the China-Japan Joint Conference on Computational Geometry, Graphs and Applications, to appear, Dalian, China, 2010.
[5] Boris Aronov and Joseph O'Rourke. Nonoverlap of the star unfolding. Discrete &
Computational Geometry, 8:219-250, 1992.
[6] Therese Biedl, Erik Demaine, Martin Demaine, Anna Lubiw, Mark Overmars, Joseph O'Rourke, Steve Robbins, and Sue Whitesides. Unfolding some classes of orthogonal polyhedra. In Proceedings of the 10th Canadian Conference on Computational Geometry, Montreal, Quebec, Canada, 1998.
[7] Mirela Damian, Robin Flatland, Henk Meijer, and Joseph O'Rourke. Unfolding well-separated orthotrees. In 15th Annu. Fall Workshop Comput. Geom., pages 23-25, 2005.
[8] Mirela Damian, Robin Y. Flatland, and Joseph O'Rourke. Epsilon-unfolding orthogonal polyhedra. Graphs and Combinatorics, 23(Suppl):179-194, 2006.
[9] Mirela Damian, Robin Y. Flatland, and Joseph O'Rourke. Grid vertex-unfolding or-
thogonal polyhedra. Discrete & Computational Geometry, 39(1-3):213-238, 2008.
[10] Mirela Damian, Robin Y. Flatland, and Joseph O'Rourke. Unfolding manhattan towers. Comput. Geom., 40(2):102-114, 2008.
[11] Mirela Damian and Henk Meijer. Grid edge-unfolding orthostacks with orthogonally convex slabs. Proc. of the 14th Workshop on Computational Geometry, pages 25-26, 2004.
[12] Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, and Joseph O'Rourke. Vertex-unfoldings of simplicial polyhedra. Technical Report 071, Smith College, 2001.
[13] Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, and Joseph O'Rourke. Vertex-unfolding of simplicial manifolds. In Discrete Geometry: In Honor of W. Kuperberg's 60th Birthday, pages 215-228. Marcer Dekker Inc., 2003.
[14] Erik D. Demaine, John Iacono, and Stefan Langerman. Grid vertex-unfolding
orthostacks. International Journal of Computational Geometry and Applications,
20(3):245-254, 2010.
[15] S. K. Gupta, D. A. Bourne, K. H. Kim, and S. S. Krishnan. Automated process planning for sheet metal bending operations. Journal of Manufacturing Systems, 17:338-360, 1998.
[16] Joseph O'Rourke. Unfolding orthogonal terrains. abs/0707.0610, 2007.
[17] Joseph O'Rourke. Unfolding orthogonal polyhedra. In Proc. Snowbird Conference Discrete and Computational Geometry: Twenty Years Later, pages 307-317. 2008.
[18] Joseph O'Rourke. Unfolding polyhedra. Solicited for Shaping Space: A Polyhedral
Approach, 2008.
[19] Cheng-Hua Wang. Manufacturability-driven decomposition of sheet metal. Technical report, 1997.