Morphing Schnyder Drawings of Planar Triangulations

Abstract

AbstractWe consider the problem of morphing between two planar drawings of the same triangulated graph, maintaining straight-line planarity. A paper in SODA 2013 gave a morph that consists of O(n 2) steps where each step is a linear morph that moves each of the n vertices in a straight line at uniform speed [1]. However, their method imitates edge contractions so the grid size of the intermediate drawings is not bounded and the morphs are not good for visualization purposes. Using Schnyder embeddings, we are able to morph in O(n 2) linear morphing steps and improve the grid size to O(n)×O(n) for a significant class of drawings of triangulations, namely the class of weighted Schnyder drawings. The morphs are visually attractive. Our method involves implementing the basic “flip” operations of Schnyder woods as linear morphs.Keywordsalgorithmscomputational geometrygraph theory