2026-09-18T23:38:44Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/847292022-01-13T07:54:01Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Erik Demaine.
Chen, Yanping, M. Eng. Massachusetts Institute of Technology
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2014-02-10T14:55:24Z
2014-02-10T14:55:24Z
2013
http://hdl.handle.net/1721.1/84729
868890821
Thesis (M. Eng.)--Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2013.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 97-98).
In this thesis we consider the centuries-old question of edge-unfolding convex polyhedra, focusing specifically on edge-unfoldability of convex polyhedral terrain which are "almost at" in that they have very small height. We demonstrate how to determine whether cut-trees of such almost-at terrains unfold and prove that, in this context, any partial cut-tree which unfolds without overlap and "opens" at a root edge can be locally extended by a neighboring edge of this root edge. We show that, for certain (but not all) planar graphs G, there are cut-trees which unfold for all almost-at terrains whose planar projection is G. We also demonstrate a non-cut-tree-based method of unfolding which relies on "slice" operations to build an unfolding of a complicated terrain from a known unfolding of a simpler terrain. Finally, we describe several heuristics for generating cut-forests and provide some computational results of such heuristics on unfolding almost-at convex polyhedral terrains.
by Yanping Chen.
M.Eng.
98 pages
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Edge-unfolding almost-flat convex polyhedral terrains
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="29b7266e-9772-4104-83ec-5a50e6e4fc63">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Edge-unfolding almost-flat convex polyhedral terrains</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2013</PublicationDate>
<Authors>
<Author>
<DisplayName>Chen, Yanping, M. Eng. Massachusetts Institute of Technology</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>In this thesis we consider the centuries-old question of edge-unfolding convex polyhedra, focusing specifically on edge-unfoldability of convex polyhedral terrain which are "almost at" in that they have very small height. We demonstrate how to determine whether cut-trees of such almost-at terrains unfold and prove that, in this context, any partial cut-tree which unfolds without overlap and "opens" at a root edge can be locally extended by a neighboring edge of this root edge. We show that, for certain (but not all) planar graphs G, there are cut-trees which unfold for all almost-at terrains whose planar projection is G. We also demonstrate a non-cut-tree-based method of unfolding which relies on "slice" operations to build an unfolding of a complicated terrain from a known unfolding of a simpler terrain. Finally, we describe several heuristics for generating cut-forests and provide some computational results of such heuristics on unfolding almost-at convex polyhedral terrains.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>