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 provides a significant improvement in complexity over other planarity preserving morphs.
منابع مشابه
Morphing Planar Graph Drawings with Bent Edges
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, where each elementary step is a linear morph that moves each vertex in a straight line at uniform speed. Although there are planarity-preserving morphs that do not require edge bends, it is an open problem to find polynom...
متن کامل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...
متن کاملMorphing Schnyder Drawings of Planar Triangulations
We 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) 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 drawing...
متن کامل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
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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007