Ambiguity-Free Edge-Bundling for Interactive Graph Visualization
暂无分享,去创建一个
[1] Piet Hut,et al. A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.
[2] Kozo Sugiyama,et al. Layout Adjustment and the Mental Map , 1995, J. Vis. Lang. Comput..
[3] 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).
[4] Jarke J. van Wijk,et al. Force‐Directed Edge Bundling for Graph Visualization , 2009, Comput. Graph. Forum.
[5] Frank van Ham,et al. Using multilevel call matrices in large software projects , 2003, IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714).
[6] G. W. Furnas,et al. Generalized fisheye views , 1986, CHI '86.
[7] Hong Zhou,et al. Controllable and Progressive Edge Clustering for Large Networks , 2006, Graph Drawing.
[8] Helen C. Purchase,et al. Which Aesthetic has the Greatest Effect on Human Understanding? , 1997, GD.
[9] Jie Wu,et al. Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .
[10] Hiroshi Nagamochi,et al. Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs , 1996, Algorithmica.
[11] George Furnas,et al. The FISHEYE view: A new look at structured files , 1986, CHI 1986.
[12] Hanan Samet,et al. The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.
[13] Hong Zhou,et al. Energy-Based Hierarchical Edge Clustering of Graphs , 2008, 2008 IEEE Pacific Visualization Symposium.
[14] Edward L. Robertson,et al. Nonlinear magnification fields , 1997, Proceedings of VIZ '97: Visualization Conference, Information Visualization Symposium and Parallel Rendering Symposium.
[15] Colin Ware,et al. Cognitive Measurements of Graph Aesthetics , 2002, Inf. Vis..
[16] Kim Marriott,et al. Topology Preserving Constrained Graph Layout , 2009, GD.
[17] M. Sheelagh T. Carpendale,et al. Examining edge congestion , 2001, CHI Extended Abstracts.
[18] Manojit Sarkar,et al. Graphical fisheye views of graphs , 1992, CHI.
[19] Ivan Herman,et al. Graph Visualization and Navigation in Information Visualization: A Survey , 2000, IEEE Trans. Vis. Comput. Graph..
[20] Ioannis G. Tollis,et al. Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..
[21] Mark D. Apperley,et al. A review and taxonomy of distortion-oriented presentation techniques , 1994, TCHI.
[22] Sharon L. Milgram,et al. The Small World Problem , 1967 .
[23] Saul Greenberg,et al. Navigating hierarchically clustered networks through fisheye and full-zoom methods , 1996, TCHI.
[24] Hong Zhou,et al. Geometry-Based Edge Clustering for Graph Visualization , 2008, IEEE Transactions on Visualization and Computer Graphics.
[25] Graham J. Wills,et al. Visualizing Network Data , 2009, Encyclopedia of Database Systems.
[26] Danny Holten,et al. Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data , 2006, IEEE Transactions on Visualization and Computer Graphics.
[27] Ben Shneiderman,et al. Readings in information visualization - using vision to think , 1999 .
[28] David Eppstein,et al. Journal of Graph Algorithms and Applications Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way , 2022 .
[29] P. Hanrahan,et al. Flow map layout , 2005, IEEE Symposium on Information Visualization, 2005. INFOVIS 2005..
[30] M. Newman,et al. Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[31] Sheelagh Carpendale,et al. Interactive Poster: Using Edge Plucking for Interactive Graph Exploration , 2005 .
[32] Edward L. Robertson,et al. Techniques for non-linear magnification transformations , 1996, Proceedings IEEE Symposium on Information Visualization '96.
[33] Jarke J. van Wijk,et al. Interactive Visualization of Small World Graphs , 2004, IEEE Symposium on Information Visualization.