Use this URL to cite or link to this record in EThOS:
Title: Unfolding polyhedra
Author: Benton, P. A.
Awarding Body: University of Cambridge
Current Institution: University of Cambridge
Date of Award: 2008
Availability of Full Text:
Full text unavailable from EThOS.
Please contact the current institution’s library for further details.
It is a common conjecture that all convex polyhedra must be edge-unfoldable but to date a valid proof of this has escaped discovery. This dissertation presents several new directions in the quest for the proof. Also discussed is a method which may lead to a counterexample to the conjecture through the construction of ‘hard to unfold’ polyhedra. Algorithmic solutions are discussed for the task of determining the specific set of edges which must be cut in order that an unfolding not self-intersect. A series of Unfolder algorithms are explored and compared, in terms of both algorithmic design and empirical performance on test data. No surface of uniformly negative internal curvature with fewer than two border curves is unfoldable. The coolinoids are a class of non-convex polyhedra having exactly two border curves and negative curvature at every internal vertex, which may be constructed so as to be unfoldable without overlap. The fascinating interaction between construction and overlap in coolinoids is modelled and explored.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available