Morphing planar triangulations
| dc.contributor.author | Barrera-Cruz, Fidel | |
| dc.date.accessioned | 2014-06-09T14:23:05Z | |
| dc.date.available | 2014-06-09T14:23:05Z | |
| dc.date.issued | 2014-06-09 | |
| dc.date.submitted | 2014 | |
| dc.description.abstract | A morph between two drawings of the same graph can be thought of as a continuous deformation between the two given drawings. A morph is linear if every vertex moves along a straight line segment from its initial position to its final position. In this thesis we study algorithms for morphing, in which the morphs are given by sequences of linear morphing steps. In 1944, Cairns proved that it is possible to morph between any two planar drawings of a planar triangulation while preserving planarity during the morph. However this morph may require exponentially many steps. It was not until 2013 that Alamdari et al. proved that the morphing problem for planar triangulations can be solved using polynomially many steps. In 1990 it was shown by Schnyder that using special drawings that we call Schnyder drawings it is possible to draw a planar graph on a O(n)×O(n) grid, and moreover such drawings can be found in O(n) time (here n denotes the number of vertices of the graph). It still remains unknown whether there is an efficient algorithm for morphing in which all drawings are on a polynomially sized grid. In this thesis we give two different new solutions to the morphing problem for planar triangulations. Our first solution gives a strengthening of the result of Alamdari et al. where each step is a unidirectional morph. This also leads to a simpler proof of their result. Our second morphing algorithm finds a planar morph consisting of O(n²) steps between any two Schnyder drawings while remaining in an O(n)×O(n) grid. However, there are drawings of planar triangulations which are not Schnyder drawings, and for these drawings we show that a unidirectional morph consisting of O(n) steps that ends at a Schnyder drawing can be found. We conclude this work by showing that the basic steps from our morphs can be implemented using a Schnyder wood and weight shifts on the set of interior faces. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/8518 | |
| dc.language.iso | en | en |
| dc.pending | false | |
| dc.publisher | University of Waterloo | en |
| dc.subject | graph theory | en |
| dc.subject | algorithms | en |
| dc.subject | morphing | en |
| dc.subject | Schnyder's Theorem | en |
| dc.subject.program | Combinatorics and Optimization | en |
| dc.title | Morphing planar triangulations | en |
| dc.type | Doctoral Thesis | en |
| uws-etd.degree | Doctor of Philosophy | en |
| uws-etd.degree.department | Combinatorics and Optimization | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |