Map Folding
| dc.contributor.author | Nishat, Rahnuma Islam | |
| dc.contributor.supervisor | Whitesides, Sue H. | |
| dc.date.accessioned | 2013-04-29T18:58:09Z | |
| dc.date.available | 2013-04-29T18:58:09Z | |
| dc.date.copyright | 2013 | en_US |
| dc.date.issued | 2013-04-29 | |
| dc.degree.department | Department of Computer Science | |
| dc.degree.level | Master of Science M.Sc. | en_US |
| dc.description.abstract | A crease pattern is an embedded planar graph on a piece of paper. An m × n map is a rectangular piece of paper with a crease pattern that partitions the paper into an m × n regular grid of unit squares. If a map has a configuration such that all the faces of the map are stacked on a unit square and the paper does not self-intersect, then it is flat foldable, and the linear ordering of the faces is called a valid linear ordering. Otherwise, the map is unfoldable. In this thesis, we show that, given a linear ordering of the faces of an m × n map, we can decide in linear time whether it is a valid linear ordering or not. We also define a class of unfoldable 2 × n crease patterns for every n ≥ 5. | en_US |
| dc.description.proquestcode | 0984 | en_US |
| dc.description.scholarlevel | Graduate | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/4565 | |
| dc.language | English | eng |
| dc.language.iso | en | en_US |
| dc.rights.temp | Available to the World Wide Web | en_US |
| dc.subject | Paper Folding | en_US |
| dc.subject | Computational Geometry | en_US |
| dc.subject | Map Folding | en_US |
| dc.subject | Linear Orderings | en_US |
| dc.title | Map Folding | en_US |
| dc.type | Thesis | en_US |