Improving Layered Graph Layouts with Edge Bundling

Abstract

We show how to improve the Sugiyama scheme by edge bundling. Our method modifies the layout produced by the Sugiyama scheme by bundling some of the edges together. The bundles are created by a new algorithm based on minimizing the total ink needed to draw the graph edges. We give several implementations that vary in quality of the resulting layout and execution time. To diminish the number of edge crossings inside of the bundles we apply a metroline crossing minimization technique. The method preserves the Sugiyama style of the layout and creates a more readable view of the graph.

An Evolutionary Algorithm for an Optimization Model of Edge Bundling

“…Some of these methods focus on minimizing a particular aspect of the drawing that can be mathematically formalized, for example, reducing ink used or the number edges that cross. However, they do not search for an optimal solution, but instead, merely employ heuristic methods to produce solutions [42]. On the other hand, our approach involves an optimization algorithm with the purpose of finding high-quality solutions for a formal and precise problem definition.…”

Functional Decomposition for Bundled Simplification of Trail Sets

“…For this, two kinds of methods exist. Explicit methods build a support data structure I from P and next define B based on I: Hierarchical methods build I from the hierarchy of a compound graph [10,13,23,28,68] or a tree extracted from a DAG [54]; generalgraph methods use spanning trees [51], Steiner trees [9], spiral trees [8], Voronoi diagrams [14,39], and Delaunay triangulations [14,55]. Given I, paths are routed along it as smooth curves, e.g.…”

Orthogonal Hyperedge Routing

“…Hyperedge routing is loosely related to edge bundling in which edge segments originating at the same node are collapsed together [3,4,8].…”