Edge routing with ordered bundles

Argyriou, 2009, Two polynomial time algorithms for the metro-line crossing minimization problem, vol. 5417, 336 Asquith, 2008, An ILP for the metro-line crossing problem, vol. 77, 49 Bar, 2006, Humans prefer curved visual objects, Psychol. Sci., 17, 645, 10.1111/j.1467-9280.2006.01759.x Bekos, 2008, Line crossing minimization on metro maps, vol. 4875, 231 Benkert, 2007, Minimizing intra-edge crossings in wiring diagrams and public transportation maps, vol. 4372, 270 Bereg, 2013, Drawing permutations with few corners, vol. 8242, 484 Cermák, 2011, Edge routing and bundling for graphs with fixed node positions, 475 Chen, 1998, On crossing minimization problem, IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., 17, 406, 10.1109/43.703928 Clarkson, 1987, Approximation algorithms for shortest path motion planning (extended abstract), 56 Cole, 1984, River routing every which way, but loose (extended abstract), 65 Cui, 2008, Geometry-based edge clustering for graph visualization, IEEE Trans. Vis. Comput. Graph., 14, 1277, 10.1109/TVCG.2008.135 Dai, 1991, Topological routing in SURF: generating a rubber-band sketch, 39 Dickerson, 2005, Confluent drawings: visualizing non-planar diagrams in a planar way, J. Graph Algorithms Appl., 9, 31, 10.7155/jgaa.00099 Dobkin, 1997, Implementing a general-purpose edge router, vol. 1353, 262 Domiter, 2008, Sweep-line algorithm for constrained Delaunay triangulation, Int. J. Geogr. Inf. Sci., 22, 449, 10.1080/13658810701492241 Dwyer, 2007, Integrating edge routing into force-directed layout, vol. 4372, 8 Dwyer, 2009, Fast edge-routing for large graphs, vol. 5849, 147 Eppstein, 2007, Confluent layered drawings, Algorithmica, 47, 439, 10.1007/s00453-006-0159-8 Ersoy, 2011, Skeleton-based edge bundling for graph visualization, IEEE Trans. Vis. Comput. Graph., 17, 2364, 10.1109/TVCG.2011.233 Fink, 2013, Drawing metro maps using Bézier curves, vol. 7704, 463 Fink, 2013, Metro-line crossing minimization: hardness, approximations, and tractable cases, vol. 8242, 328 Fink, 2013, Ordering metro lines by block crossings, vol. 8087, 397 Gansner, 2011, Multilevel agglomerative edge bundling for visualizing large graphs, 187 Gansner, 2006, Improved circular layouts, vol. 4372, 386 Garey, 1979 Groeneveld, 1989, Wire ordering for detailed routing, IEEE Des. Test Comput., 6, 6, 10.1109/54.41670 Guttman, 1984, R-trees: a dynamic index structure for spatial searching, 47 Holten, 2006, Hierarchical edge bundles: visualization of adjacency relations in hierarchical data, IEEE Trans. Vis. Comput. Graph., 12, 741, 10.1109/TVCG.2006.147 Holten, 2009, Force-directed edge bundling for graph visualization, Comput. Graph. Forum, 28, 983, 10.1111/j.1467-8659.2009.01450.x Hurter, 2012, Graph bundling by kernel density estimation, vol. 31, 865 Lambert, 2010, Winding roads: routing edges into bundles, Comput. Graph. Forum, 29, 853, 10.1111/j.1467-8659.2009.01700.x Marek-Sadowska, 1995, The crossing distribution problem [IC layout], IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., 14, 423, 10.1109/43.372368 Middendorf, 1993, On the complexity of the disjoint paths problems, Combinatorica, 13, 97, 10.1007/BF01202792 Nachmanson, 2007, Drawing graphs with GLEE, vol. 4875, 389 Newbery, 1989, Edge concentration: a method for clustering directed graphs, 76 Nöllenburg, 2009, An improved algorithm for the metro-line crossing minimization problem, vol. 5849, 381 Piegl, 2002, Biarc approximation of NURBS curves, Comput. Aided Des., 34, 807, 10.1016/S0010-4485(01)00160-9 Pupyrev, 2012, Edge routing with ordered bundles, vol. 7034, 136 Pupyrev, 2010, Improving layered graph layouts with edge bundling, vol. 6502, 465 Purchase, 2013, On the usability of Lombardi graph drawings, vol. 7704, 451 Wein, 2007, The visibility-Voronoi complex and its applications, Comput. Geom. Theory Appl., 36, 66, 10.1016/j.comgeo.2005.11.007 Xu, 2012, A user study on curved edges in graph visualization, IEEE Trans. Vis. Comput. Graph., 18, 2449, 10.1109/TVCG.2012.189 Yao, 1982, On constructing minimum spanning trees in k-dimensional spaces and related problems, SIAM J. Comput., 11, 721, 10.1137/0211059