Folding Orthogonal Polyhedra

Computer Science;folding;orthogonal;polyhedra;rectilinear;paper;cutout

Sun, Julie

University of Waterloo

关键词: Computer Science;    folding;    orthogonal;    polyhedra;    rectilinear;    paper;    cutout;   

Others  :  https://uwspace.uwaterloo.ca/bitstream/10012/1111/1/jsun1999.pdf

瑞士|英语

来源: UWSPACE Waterloo Institutional Repository

【 摘 要 】

In this thesis, we study foldings of orthogonal polygons into orthogonal polyhedra.The particular problem examined here is whether a paper cutout of an orthogonal polygon with fold lines indicated folds up into a simple orthogonal polyhedron.The folds are orthogonal and the direction of the fold (upward or downward) is also given. We present a polynomial time algorithm to solve this problem. Next we consider the same problem with the exception that the direction of the folds are not given.We prove that this problem is NP-complete. Once it has been determined that a polygon does fold into a polyhedron, we consider some restrictions on the actual folding process, modelling the case when the polyhedron is constructed from a stiff material such as sheet metal.We show an example of a polygon that cannot be folded into a polyhedron if folds can only be executed one at a time.Removing this restriction, we show another polygon that cannot be folded into a polyhedron using rigid material.