Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts
Fabian Klute, Martin Nöllenburg
备注:
This is the full version of a paper with the same title appearing in the proceedings of the 34th International Symposium on Computational Geometry (SoCG) 2018
Circular layouts are a popular graph drawing style, where vertices are placed on a circle and edges are drawn as straight chords. Crossing minimization in circular layouts is \NP-hard. One way to allow for fewer crossings in practice are two-sided layouts that draw some edges as curves in the exterior of the circle. In fact, one- and two-sided circular layouts are equivalent to one-page and two-page book drawings, i.e., graph layouts with all vertices placed on a line (the spine) and edges drawn in one or two distinct half-planes (the pages) bounded by the spine. In this paper we study the problem of minimizing the crossings for a fixed cyclic vertex order by computing an optimal $k$-plane set of exteriorly drawn edges for $k \ge 1$, extending the previously studied case $k=0$. We show that this relates to finding bounded-degree maximum-weight induced subgraphs of circle graphs, which is a graph-theoretic problem of independent interest. We show \NP-hardness for arbitrary $k$, present an efficient algorithm for $k=1$, and generalize it to an explicit \XP-time algorithm for any fixed $k$. For the practically interesting case $k=1$ we implemented our algorithm and present experimental results that confirm the applicability of our algorithm.
A parent-centered radial layout algorithm for interactive graph visualization and animation
我们已经开发了(1)一个图形可视化系统,允许用户通过查看它们作为一系列交互选择的生成树来探索图形,(2)一个径向图布局算法,以及(3)一个动画算法,该算法生成有意义的可视化和图形之间的平滑过渡,同时最大限度地减少过渡期间和静态布局中的边缘交叉。我们的系统类似于Yee et al.(2001)的径向布局系统,但主要区别在于每个节点都位于以其自己的父节点为中心的坐标系上,而不是所有节点都位于单个坐标系上。因此,我们的系统很容易定义递归和本身的并行化。它还保证布局具有许多很好的属性,例如:它保证某些边缘在动画期间不会交叉。我们比较了我们的算法所产生的布局和过渡Yee等人。从几个实验的结果表明,我们的系统产生更少的边缘交叉之间的图形绘制的过渡过程中,和过渡更经常涉及局部缩放的变化,而不是结构。这些发现表明,该系统有希望作为一个互动的图形探索工具,在各种设置。
Khoury College of Computer Sciences, Northeastern University(东北大学科里计算机科学学院);School of Computer Science, University of Windsor(温莎大学计算机学院);School of Computer Science, Carleton University(卡尔顿大学计算机学院);School of Electrical Engineering and Computer Science, University of Ottawa(渥太华大学电气与计算机工程学院);Computer Science Department, University of California, Irvine(加州大学欧文分校计算机科学系);Department of Mathematics, California State University Northridge(北岭加利福尼亚州立大学数学系);Department of Computer Science, Tufts University(塔夫茨大学计算机科学系);Department of Applied Mathematics, Charles University(查理大学应用数学系)