How to Morph Planar Graph Drawings
نویسندگان
چکیده
Given an n-vertex graph and two straight-line planar drawings of the graph that have the same faces and the same outer face, we show that there is a morph (i.e., a continuous transformation) between the two drawings that preserves straight-line planarity and consists of O(n) steps, which we prove is optimal in the worst case. Each step is a unidirectional linear morph, which means that every vertex moves at constant speed along a straight line, and the lines are parallel although the vertex speeds may differ. Thus we provide an efficient version of Cairns’ 1944 proof of the existence of straight-line planarity-preserving morphs for triangulated graphs, which required an exponential number of steps.
منابع مشابه
Morphing Planar Graphs Drawings Efficiently
A morph between two straight-line planar drawings of the same graph is a continuous transformation from the first to the second drawing such that planarity is preserved at all times. Each step of the morph moves each vertex at constant speed along a straight line. Although the existence of a morph between any two drawings was established several decades ago, only recently it has been proved tha...
متن کاملA Bent Edge Morph for Planar Graph Drawings
We give an algorithm to morph between two planar graph drawings of a graph, preserving planarity. The morph uses a polynomial number of elementary steps. Each step, is composed of a linear morph or a sequence of two linear morphs allowing a vertex to change direction. The planarity is preserved by allowing edges to bend to avoid collisions with the features of the drawing. This algorithm also p...
متن کاملMorphing Planar Graph Drawings
The study of planar graphs dates back to Euler and the earliest days of graph theory. Centuries later came the proofs by Wagner, Fáry and Stein that every planar graph can be drawn with straight line segments for the edges, and the algorithm by Tutte for constructing such straight-line drawings given in his 1963 paper, “How to Draw a Graph”. With more recent attention to complexity issues, this...
متن کاملMorphing Planar Graph Drawings with a Polynomial Number of Steps
In 1944, Cairns proved the following theorem: given any two straight-line planar drawings of a triangulation with the same outer face, there exists a morph (i.e., a continuous transformation) between the two drawings so that the drawing remains straight-line planar at all times. Cairns’s original proof required exponentially many morphing steps. We prove that there is a morph that consists ofO(...
متن کاملMorphing Planar Graph Drawings Optimally
We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any n-vertex plane graph in O(n) morphing steps, thus improving upon the previously best known O(n) upper bound. Further, we prove that our algorithm is optimal, that is, we show that there exist two planar straight-line drawings Γs and Γt of an n-vertex plane graph G such that any planar morph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 46 شماره
صفحات -
تاریخ انتشار 2017