Kun-Ting Chen
Tim Dwyer
ABSTRACT
We explore network visualisation on a two-dimensional torus topology that continuously wraps when the viewport is panned. That is, links may be “wrapped” across the boundary, allowing additional spreading of node positions to reduce visual clutter. Recent work has investigated such pannable wrapped visualisations, finding them not worse than unwrapped drawings for small networks for path-following tasks. However, they did not evaluate larger networks nor did they consider whether torus-based layout might also better display high-level network structure like clusters. We offer two algorithms for improving toroidal layout that is completely autonomous and automatic panning of the viewport to minimiswe wrapping links. The resulting layouts afford fewer crossings, less stress, and greater cluster separation. In a study of 32 participants comparing performance in cluster understanding tasks, we find that toroidal visualisation offers significant benefits over standard unwrapped visualisation in terms of improvement in error by 62.7% and time by 32.3%.
Supplemental Material
Available for Download
- 2015. WebCoLa: Constraint-Based Layout in the Browser. https://ialab.it.monash.edu/webcolaGoogle Scholar
- Yong-Yeol Ahn, Sebastian E Ahnert, James P Bagrow, and Albert-László Barabási. 2011. Flavor network and the principles of food pairing. Scientific reports 1(2011), 196.Google Scholar
- Michael Behrisch, Benjamin Bach, Nathalie Henry Riche, Tobias Schreck, and Jean-Daniel Fekete. 2016. Matrix reordering methods for table and network visualization. In Computer Graphics Forum, Vol. 35. Wiley Online Library, 693–716.Google Scholar
- Ingwer Borg and Patrick JF Groenen. 2005. Modern multidimensional scaling: Theory and applications. Springer Science & Business Media.Google Scholar
- Mike Bostok. 2011 (accessed 21 April, 2020). https://d3js.org/. https://d3js.org/Google Scholar
- Ulrik Brandes, Marco Gaertler, and Dorothea Wagner. 2003. Experiments on graph clustering algorithms. In European Symposium on Algorithms. Springer, 568–579.Google ScholarCross Ref
- Ulrik Brandes and Christian Pich. 2008. An experimental study on distance-based graph drawing. In International Symposium on Graph Drawing. Springer, 218–229.Google Scholar
- Kun-Ting Chen, Tim Dwyer, Kim Marriott, and Benjamin Bach. 2020. DoughNets: Visualising Networks Using Torus Wrapping. In Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems. 1–11.Google ScholarDigital Library
- Christopher Collins, Gerald Penn, and Sheelagh Carpendale. 2009. Bubble sets: Revealing set relations with isocontours over existing visualizations. IEEE Transactions on Visualization and Computer Graphics 15, 6(2009), 1009–1016.Google ScholarDigital Library
- Sabin Devkota, Reyan Ahmed, Felice De Luca, Katherine E Isaacs, and Stephen Kobourov. 2019. Stress-Plus-X (SPX) Graph Layout. In International Symposium on Graph Drawing and Network Visualization. Springer, 291–304.Google Scholar
- Tim Dwyer. 2009. Scalable, versatile and simple constrained graph layout. In Computer Graphics Forum, Vol. 28. Wiley Online Library, 991–998.Google Scholar
- Tim Dwyer, Bongshin Lee, Danyel Fisher, Kori Inkpen Quinn, Petra Isenberg, George Robertson, and Chris North. 2009. A comparison of user-generated and automatic graph layouts. IEEE transactions on visualization and computer graphics 15, 6(2009), 961–968.Google ScholarDigital Library
- Tim Dwyer, Kim Marriott, Falk Schreiber, Peter Stuckey, Michael Woodward, and Michael Wybrow. 2008. Exploration of networks using overview+ detail with constraint-based cooperative layout. IEEE Transactions on Visualization and Computer Graphics 14, 6(2008), 1293–1300.Google ScholarDigital Library
- Tim Dwyer, Kim Marriott, and Michael Wybrow. 2008. Topology preserving constrained graph layout. In International Symposium on Graph Drawing. Springer, 230–241.Google Scholar
- Santo Fortunato. 2010. Community detection in graphs. Physics reports 486, 3-5 (2010), 75–174.Google Scholar
- Emden R Gansner, Yifan Hu, and Stephen G Kobourov. 2009. Gmap: Drawing graphs as maps. In International Symposium on Graph Drawing. Springer, 405–407.Google Scholar
- Emden R Gansner, Yehuda Koren, and Stephen North. 2004. Graph drawing by stress majorization. In International Symposium on Graph Drawing. Springer, 239–250.Google Scholar
- Michelle Girvan and Mark EJ Newman. 2002. Community structure in social and biological networks. Proceedings of the national academy of sciences 99, 12 (2002), 7821–7826.Google ScholarCross Ref
- Yifan Hu, Emden R Gansner, and Stephen Kobourov. 2010. Visualizing graphs and clusters as maps. IEEE Computer Graphics and Applications 30, 6 (2010), 54–66.Google ScholarDigital Library
- Weidong Huang, Peter Eades, and Seok-Hee Hong. 2009. Measuring effectiveness of graph visualizations: A cognitive load perspective. Information Visualization 8, 3 (2009), 139–152.Google ScholarDigital Library
- Weidong Huang, Seok-Hee Hong, and Peter Eades. 2008. Effects of crossing angles. In 2008 IEEE Pacific Visualization Symposium. IEEE, 41–46.Google ScholarCross Ref
- Stephen G Kobourov and Kevin Wampler. 2005. Non-Euclidean spring embedders. IEEE Transactions on Visualization and Computer Graphics 11, 6(2005), 757–767.Google ScholarDigital Library
- William Kocay, Daniel Neilson, and Ryan Szypowski. 2001. Drawing graphs on the torus. Ars Combinatoria 59, 2 (2001), 259–277.Google Scholar
- Teuvo Kohonen. 1982. Self-organized formation of topologically correct feature maps. Biological cybernetics 43, 1 (1982), 59–69.Google Scholar
- Bongshin Lee, Catherine Plaisant, Cynthia Sims Parr, Jean-Daniel Fekete, and Nathalie Henry. 2006. Task Taxonomy for Graph Visualization. In Proceedings of the 2006 AVI Workshop on BEyond Time and Errors: Novel Evaluation Methods for Information Visualization (Venice, Italy) (BELIV ’06). ACM, New York, NY, USA, 1–5. https://doi.org/10.1145/1168149.1168168Google ScholarDigital Library
- Shixia Liu, Weiwei Cui, Yingcai Wu, and Mengchen Liu. 2014. A survey on information visualization: recent advances and challenges. The Visual Computer 30, 12 (2014), 1373–1393.Google ScholarDigital Library
- Jiawei Lu and Yain-Whar Si. 2020. Clustering-based force-directed algorithms for 3D graph visualization. The Journal of Supercomputing(2020), 1–62.Google Scholar
- Wouter Meulemans, Nathalie Henry Riche, Bettina Speckmann, Basak Alper, and Tim Dwyer. 2013. Kelpfusion: A hybrid set visualization technique. IEEE transactions on visualization and computer graphics 19, 11(2013), 1846–1858.Google Scholar
- Nina Mishra, Robert Schreiber, Isabelle Stanton, and Robert E Tarjan. 2007. Clustering social networks. In International Workshop on Algorithms and Models for the Web-Graph. Springer, 56–67.Google ScholarDigital Library
- Tamara Munzner. 2014. Visualization analysis and design. CRC press.Google Scholar
- Mark EJ Newman. 2006. Modularity and community structure in networks. Proceedings of the national academy of sciences 103, 23(2006), 8577–8582.Google ScholarCross Ref
- Mershack Okoe, Radu Jianu, and Stephen Kobourov. 2018. Node-link or adjacency matrices: Old question, new insights. IEEE transactions on visualization and computer graphics 25, 10(2018), 2940–2952.Google Scholar
- Chong Jin Ong and Elmer G Gilbert. 1997. The Gilbert-Johnson-Keerthi distance algorithm: A fast version for incremental motions. In Proceedings of International Conference on Robotics and Automation, Vol. 2. IEEE, 1183–1189.Google Scholar
- Python Package. 2019. NetworkX graph library. https://networkx.github.io. Last accessd: September thirteenth, 2020.Google Scholar
- Helen Purchase. 1997. Which aesthetic has the greatest effect on human understanding?. In International Symposium on Graph Drawing. Springer, 248–261.Google ScholarDigital Library
- Helen C Purchase. 2002. Metrics for graph drawing aesthetics. Journal of Visual Languages & Computing 13, 5 (2002), 501–516.Google ScholarCross Ref
- Helen C Purchase, David Carrington, and Jo-Anne Allder. 2002. Empirical evaluation of aesthetics-based graph layout. Empirical Software Engineering 7, 3 (2002), 233–255.Google ScholarDigital Library
- Aaron Quigley and Peter Eades. 2000. Fade: Graph drawing, clustering, and visual abstraction. In International Symposium on Graph Drawing. Springer, 197–210.Google Scholar
- Bahador Saket, Paolo Simonetto, and Stephen Kobourov. 2014. Group-level graph visualization taxonomy. arXiv preprint arXiv:1403.7421(2014).Google Scholar
- Bahador Saket, Paolo Simonetto, Stephen Kobourov, and Katy Börner. 2014. Node, node-link, and node-link-group diagrams: An evaluation. IEEE Transactions on Visualization and Computer Graphics 20, 12(2014), 2231–2240.Google ScholarCross Ref
- Michael Ian Shamos and Dan Hoey. 1976. Geometric intersection problems. In 17th Annual Symposium on Foundations of Computer Science (sfcs 1976). IEEE, 208–215.Google ScholarDigital Library
- Gino Van Den Bergen. 2001. Proximity queries and penetration depth computation on 3d game objects. In Game developers conference, Vol. 170.Google Scholar
- Corinna Vehlow, Fabian Beck, and Daniel Weiskopf. 2017. Visualizing group structures in graphs: A survey. In Computer Graphics Forum, Vol. 36. Wiley Online Library, 201–225.Google Scholar
- Chris Walshaw. 2000. A multilevel algorithm for force-directed graph drawing. In International Symposium on Graph Drawing. Springer, 171–182.Google Scholar
- Colin Ware, Helen Purchase, Linda Colpoys, and Matthew McGill. 2002. Cognitive measurements of graph aesthetics. Information Visualization 1, 2 (2002), 103–110.Google ScholarDigital Library
- Vahan Yoghourdjian, Yalong Yang, Tim Dwyer, Lee Lawrence, Michael Wybrow, and Kim Marriott. 2020. Scalability of Network Visualisation from a Cognitive Load Perspective. arXiv preprint arXiv:2008.07944(2020).Google Scholar
- Jonathan X Zheng, Samraat Pawar, and Dan FM Goodman. 2018. Graph drawing by stochastic gradient descent. IEEE transactions on visualization and computer graphics 25, 9(2018), 2738–2748.Google Scholar
Index Terms
- It’s a Wrap: Toroidal Wrapping of Network Visualisations Supports Cluster Understanding Tasks
Index terms have been assigned to the content through auto-classification.
Recommendations
DoughNets: Visualising Networks Using Torus Wrapping
CHI '20: Proceedings of the 2020 CHI Conference on Human Factors in Computing SystemsWe investigate visualisations of networks on a 2-dimensional torus topology, like an opened-up and flattened doughnut. That is, the network is drawn on a rectangular area while "wrapping" specific links around the border. Previous work on torus drawings ...
Near-Optimal Concentric Circles Layout
Advances in Visual ComputingAbstractThe majority of graph visualization algorithms emphasize improving the readability of graphs by focusing on various vertex and edge rendering techniques. However, revealing the global connectivity structure of a graph by identifying significant ...
Ambiguity-Free Edge-Bundling for Interactive Graph Visualization
Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational data sets (e.g., transportation networks, citation networks, or social networks). Graphs with dense edges, however, ...
Comments