Back to search

University of Waterloo

Folding Orthogonal Polyhedra

Abstract

dc:description.abstract

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.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
1999

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Sun, Julie

Subjects

dc:subject × 7

Rights

dc:rights
Statement dc:rights
  • Copyright: 1999, Sun, Julie. All rights reserved.
Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/1111

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Sun, Julie. Folding Orthogonal Polyhedra. University of Waterloo, 1999. http://hdl.handle.net/10012/1111