High-Quality Ultra-Compact Grid Layout of Grouped Networks

IEEE Transactions on Visualization and Computer Graphics

Volumn 22, Issue 1, 2016, Pages 339-348

  Yoghourdjian, Vahan ^a   Dwyer, Tim ^a   Gange, Graeme ^b   Kieffer, Steve ^a   Klein, Karsten ^a   Marriott, Kim ^a  

^a MONASH UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Containers; Encoding; Layout; Optimization; Pipelines; Routing; Standards

Indexed keywords

CONTAINERS; ENCODING (SYMBOLS); INTEGER PROGRAMMING; OPTIMIZATION; PIPELINES; STANDARDS;

GENERIC TECHNOLOGY; HEURISTIC TECHNIQUES; LARGE NEIGHBORHOOD SEARCH; LAYOUT; META-HEURISTIC APPROACH; MIXED INTEGER OPTIMIZATION; PIPELINE TECHNIQUES; ROUTING;

HEURISTIC METHODS;

EID: 84946607172     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2015.2467251     Document Type: Article

References (50)

1. 2014 Graph Drawing Conference contest: http://graphdrawing.de/contest2014/topic2.html.
2. CPLEX MIP solver: http://www.ibm.com/software/commerce/optimization/cplex-optimizer.
3. d3.js: http://d3js.org.
4. https://github.com/Vahany/HqUcGl-of-Grouped-Networks.
5. ILOG Concert Technology: http://www.ibm.com/software/commerce/optimization/interfaces.
6. Rome Graphs: http://www.graphdrawing.org/data/.
7. webcola: http://marvl.infotech.monash.edu/webcola.
8. yFiles automatic network layout software: http://www.yworks.com/en/products/yfiles/.
9. R. K. Ahuja, Ö. Ergun, J. B. Orlin, and A. P. Punnen. A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 123(1):75-102, 2002.
10. R. Asín, R. Nieuwenhuis, A. Oliveras, and E. Rodríguez-Carbonell. Cardinality networks: a theoretical and empirical study. Constraints, 16(2):195-221, 2011.
11. A. Barsky, T. Munzner, J. Gardy, and R. Kincaid. Cerebral: Visualizing multiple experimental conditions on a graph with biological context. Visualization and Computer Graphics, IEEE Transactions on, 14(6):1253-1260, 2008.
12. C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data flow diagrams. Software Engineering, IEEE Transactions on, (4):538-546, 1986.
13. P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. Computers, IEEE Transactions on, 49(8):826-840, 2000.
14. G. Betz, A. Gemsa, C. Mathies, I. Rutter, and D. Wagner. Column-based graph layouts. Journal of Graph Algorithms and Applications, 18(5):677-708, 2014.
15. T. Biedl, T. Bläsius, B. Niedermann, M. Nöllenburg, R. Prutkin, and I. Rutter. Using ilp/sat to determine pathwidth, visibility representations, and other grid-based graph drawings. In Graph Drawing, pages 460-471. Springer, 2013.
16. M. Codish and M. Zazon-Ivry. Pairwise cardinality networks. In 16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, volume 6355 of LNCS, pages 154-172. Springer, 2010.
17. R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics (TOG), 15(4):301-331, 1996.
18. T. Dwyer, N. Henry Riche, K. Marriott, and C. Mears. Edge compression techniques for visualization of dense directed graphs. Visualization and Computer Graphics, IEEE Transactions on, 19(12):2596-2605, 2013.
19. T. Dwyer, Y. Koren, and K. Marriott. Ipsep-cola: An incremental procedure for separation constraint layout of graphs. Visualization and Computer Graphics, IEEE Transactions on, 12(5):821-828, 2006.
20. T. Dwyer, B. Lee, D. Fisher, K. I. Quinn, P. Isenberg, G. Robertson, and C. North. A comparison of user-generated and automatic graph layouts. Visualization and Computer Graphics, IEEE Transactions on, 15(6):961-968, 2009.
21. T. Dwyer, K. Marriott, and P. J. Stuckey. Fast node overlap removal. In Graph Drawing, volume 3843 of LNCS, pages 153-164. Springer, 2006.
22. T. Dwyer, C. Mears, K. Morgan, T. Niven, K. Marriott, and M. Wallace. Improved optimal and approximate power graph compression for clearer visualisation of dense graphs. In Pacific Visualization Symposium (PacificVis), 2014 IEEE, pages 105-112. IEEE, 2014.
23. N. Eén and N. Sörensson. Translating pseudo-boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation, 2:1-26, 2006.
24. T. Feydy, A. Schutt, and P. Stuckey. Semantic learning for lazy clause generation. In TRICS workshop, held alongside CP, 2013.
25. G. Gange, P. Stuckey, and K. Marriott. Optimal k-level planarization and crossing minimization. Graph Drawing, pages 238-249, 2011.
26. E. Gansner, Y. Koren, and S. North. Graph drawing by stress majorization. In Graph Drawing, volume 3383 of LNCS, pages 239-250. Springer, 2005.
27. D. Harel and M. Sardas. Randomized graph drawing with heavy-duty preprocessing. Journal of Visual Languages & Computing, 6(3):233-253, 1995.
28. T. Jankun-Kelly and K.-L. Ma. Moiregraphs: Radial focus+ context visualization and interaction for graphs with visual nodes. In Information Visualization, 2003. INFOVIS 2003. IEEE Symposium on, pages 59-66. IEEE, 2003.
29. A. Kennedy, K. Klein, and A. Nguyen. The graph landscape - a concept for the visual analysis of graph set properties. In Submission.
30. S. Kieffer, T. Dwyer, K. Marriott, and M. Wybrow. Hola: Human-like orthogonal network layout. In submission.
31. S. Kieffer, T. Dwyer, K. Marriott, and M. Wybrow. Incremental grid-like layout using soft and hard constraints. In Graph Drawing, pages 448-459. Springer, 2013.
32. G. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. Integer Programming and Combinatorial Optimization, pages 304-319, 1999.
33. S. G. Kobourov. Force-directed drawing algorithms. Handbook of Graph Drawing and Visualization, pages 383-408, 2013.
34. K. Kojima, M. Nagasaki, E. Jeong, M. Kato, and S. Miyano. An efficient grid layout algorithm for biological networks utilizing various biological attributes. BMC bioinformatics, 8(1):76, 2007.
35. R. E. Korf, M. D. Moffitt, and M. E. Pollack. Optimal rectangle packing. Annals of Operations Research, 179(1):261-295, 2010.
36. K. Marriott, H. Purchase, M. Wybrow, and C. Goncu. Memorability of visual features in network diagrams. Visualization and Computer Graphics, IEEE Transactions on, 18(12):2477-2485, 2012.
37. A. Metodi and M. Codish. Compiling finite domain constraints to sat with bee. Theory and Practice of Logic Programming, 12(4-5):465-483, 2012.
38. J. Müller-Brockmann. Grid Systems in Graphic Design. 1981.
39. N. Nethercote, P. J. Stuckey, R. Becket, S. Brand, G. J. Duck, and G. Tack. Minizinc: Towards a standard CP modelling language. In Constraint Programming, volume 4741 of LNCS, pages 529-543. Springer, 2007.
40. M. Nöllenburg. An improved algorithm for the metro-line crossing minimization problem. In Graph Drawing, pages 381-392. Springer, 2010.
41. M. Nöllenburg and A. Wolff. A mixed-integer program for drawing high-quality metro maps. In Graph Drawing, volume 3843 of LNCS, pages 321-333. Springer, 2006.
42. D. Pisinger and S. Ropke. Large neighborhood search. In Handbook of metaheuristics, pages 399-419. Springer, 2010.
43. H. C. Purchase, C. Pilcher, and B. Plimmer. Graph drawing aesthetics created by users, not algorithms. Visualization and Computer Graphics, IEEE Transactions on, 18(1):81-92, 2012.
44. P. Rodgers. A survey of euler diagrams. Journal of Visual Languages & Computing, 25(3):134-155, 2014.
45. M. Rohrschneider, C. Heine, A. Reichenbach, A. Kerren, and G. Scheuermann. A novel grid-based visualization approach for metabolic networks with advanced focus&context view. In Graph Drawing, pages 268-279, 2009.
46. L. Royer, M. Reimann, B. Andreopoulos, and M. Schroeder. Unraveling protein networks with power graph analysis. PLoS computational biology, 4(7):e1000108, 2008.
47. G. Sander. Layout of directed hypergraphs with orthogonal hyperedges. In Graph Drawing, volume 2912 of LNCS, pages 381-386. Springer, 2004.
48. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. Systems, Man and Cybernetics, IEEE Transactions on, 11(2):109-125, 1981.
49. H. P. Williams. Model building in mathematical programming. John Wiley & Sons, 2013.
50. M. Wybrow, K. Marriott, and P. J. Stuckey. Orthogonal connector routing. In Graph Drawing, pages 219-231. Springer, 2010.