Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization
暂无分享,去创建一个
Christophe Hurter | Kim Marriott | Tim Dwyer | Benjamin Bach | Nathalie Henry Riche | N. Riche | K. Marriott | C. Hurter | Benjamin Bach | Tim Dwyer
[1] David Eppstein,et al. Confluent Layered Drawings , 2006, Algorithmica.
[2] M. Sheelagh T. Carpendale,et al. Edgelens: an interactive method for managing edge congestion in graphs , 2003, IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714).
[3] David Eppstein,et al. Journal of Graph Algorithms and Applications Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way , 2022 .
[4] Jean-Daniel Fekete,et al. An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs , 2011, 2011 IEEE Pacific Visualization Symposium.
[5] Yifan Hu,et al. Multilevel agglomerative edge bundling for visualizing large graphs , 2011, 2011 IEEE Pacific Visualization Symposium.
[6] David Eppstein,et al. Confluent Hasse Diagrams , 2013, J. Graph Algorithms Appl..
[7] Kim Marriott,et al. Edge Compression Techniques for Visualization of Dense Directed Graphs , 2013, IEEE Transactions on Visualization and Computer Graphics.
[8] Emden R. GansnerYifan. Multilevel Agglomerative Edge Bundling for Visualizing Large Graphs , 2011 .
[9] James Abello,et al. ASK-GraphView: A Large Scale Graph Visualization System , 2006, IEEE Transactions on Visualization and Computer Graphics.
[10] Kwan-Liu Ma,et al. Ambiguity-Free Edge-Bundling for Interactive Graph Visualization , 2012, IEEE Transactions on Visualization and Computer Graphics.
[11] Michael J. Pelsmajer,et al. Train Tracks and Confluent Drawings , 2006, Algorithmica.
[12] Stanley Wasserman,et al. Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.
[13] Jeffrey Heer,et al. Divided Edge Bundling for Directional Network Data , 2011, IEEE Transactions on Visualization and Computer Graphics.
[14] M E J Newman,et al. Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[15] David J. Field,et al. Contour integration by the human visual system: Evidence for a local “association field” , 1993, Vision Research.
[16] Christophe Hurter,et al. Graph Bundling by Kernel Density Estimation , 2012, Comput. Graph. Forum.
[17] Christophe Hurter,et al. Bundled Visualization of DynamicGraph and Trail Data , 2014, IEEE Transactions on Visualization and Computer Graphics.
[18] Michael Schroeder,et al. Unraveling Protein Networks with Power Graph Analysis , 2008, PLoS Comput. Biol..
[19] Nicola J. Rinaldi,et al. Transcriptional Regulatory Networks in Saccharomyces cerevisiae , 2002, Science.
[20] Christophe Hurter,et al. Attribute-driven edge bundling for general graphs with applications in trail analysis , 2015, 2015 IEEE Pacific Visualization Symposium (PacificVis).
[21] S. Lehmann,et al. Biclique communities. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.
[22] Bettina Speckmann,et al. Strict confluent drawing , 2013, J. Comput. Geom..
[23] Jean-Daniel Fekete,et al. MatrixExplorer: a Dual-Representation System to Explore Social Networks , 2006, IEEE Transactions on Visualization and Computer Graphics.
[24] U. Alon. Network motifs: theory and experimental approaches , 2007, Nature Reviews Genetics.
[25] M. Sheelagh T. Carpendale,et al. Examining edge congestion , 2001, CHI Extended Abstracts.
[26] Christophe Hurter,et al. Skeleton-Based Edge Bundling for Graph Visualization , 2011, IEEE Transactions on Visualization and Computer Graphics.
[27] David Eppstein,et al. Delta-Confluent Drawings , 2005, Graph Drawing.
[28] Peter Eades,et al. On the faithfulness of graph visualizations , 2012, 2013 IEEE Pacific Visualization Symposium (PacificVis).
[29] Daniel W. Archambault,et al. The Readability of Path‐Preserving Clusterings of Graphs , 2010, Comput. Graph. Forum.
[30] Jarke J. van Wijk,et al. Compressed Adjacency Matrices: Untangling Gene Regulatory Networks , 2012, IEEE Transactions on Visualization and Computer Graphics.
[31] Ben Shneiderman,et al. Motif simplification: improving network visualization readability with fan, connector, and clique glyphs , 2013, CHI.
[32] Sergey Bereg,et al. Edge Routing with Ordered Bundles , 2011, Graph Drawing.
[33] Kerri Morgan,et al. Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs , 2013, 2014 IEEE Pacific Visualization Symposium.
[34] Rui J. P. de Figueiredo,et al. A new neural network for cluster-detection-and-labeling , 1998, IEEE Trans. Neural Networks.
[35] Alexandru Telea,et al. CUBu: Universal Real-Time Bundling for Large Graphs , 2016, IEEE Transactions on Visualization and Computer Graphics.
[36] Massimo Ancona,et al. Confluent Drawing Algorithms Using Rectangular Dualization , 2010, GD.
[37] G. Grimmett,et al. Cluster detection in networks using percolation , 2011, 1104.0338.
[38] Jarke J. van Wijk,et al. Force‐Directed Edge Bundling for Graph Visualization , 2009, Comput. Graph. Forum.
[39] Michael Hirsch,et al. Biclique Edge Cover Graphs and Confluent Drawings , 2006, Graph Drawing.
[40] P. Hanrahan,et al. Flow map layout , 2005, IEEE Symposium on Information Visualization, 2005. INFOVIS 2005..
[41] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[42] Colin Ware,et al. Cognitive Measurements of Graph Aesthetics , 2002, Inf. Vis..
[43] Danny Holten,et al. Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data , 2006, IEEE Transactions on Visualization and Computer Graphics.
[44] Hong Zhou,et al. Edge bundling in information visualization , 2013 .
[45] Tamara Munzner,et al. GrouseFlocks: Steerable Exploration of Graph Hierarchy Space , 2008, IEEE Transactions on Visualization and Computer Graphics.