Edge Routing with Ordered Bundles
Pupyrev, Sergey and Nachmanson, Lev and Bereg, Sergey and Holroyd, Alexander E. (2012) Edge Routing with Ordered Bundles. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011, Eindhoven, The Netherlands , pp. 136-147 (Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_14).
Full text not available from this repository.
We propose a new approach to edge bundling. At the first stage we route the edge paths so as to minimize a weighted sum of the total length of the paths together with their ink. As this problem is NP-hard, we provide an efficient heuristic that finds an approximate solution. The second stage then separates edges belonging to the same bundle. To achieve this, we provide a new and efficient algorithm that solves a variant of the metro-line crossing minimization problem. The method creates aesthetically pleasing edge routes that give an overview of the global graph structure, while still drawing each edge separately, without intersecting graph nodes, and with few crossings.
Repository Staff Only: item control page