Manual Clustering Refinement using Interaction with Blobs
暂无分享,去创建一个
[1] Michael Jünger,et al. An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs , 2005, GD.
[2] Satoru Kawai,et al. An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..
[3] Jarke J. van Wijk,et al. Interactive Visualization of Small World Graphs , 2004, IEEE Symposium on Information Visualization.
[4] Markus Gross,et al. H-BLOB: a hierarchical visual clustering method using implicit surfaces , 2000 .
[5] Markus Gross,et al. Visualizing Informationon a Sphere , 1997 .
[6] Fan Chung Graham,et al. Drawing Power Law Graphs , 2004, GD.
[7] Ayellet Tal,et al. Dynamic Drawing of Clustered Graphs , 2004 .
[8] Peter Eades,et al. A Heuristic for Graph Drawing , 1984 .
[9] Colin Ware,et al. Information Visualization: Perception for Design , 2000 .
[10] Edward M. Reingold,et al. Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..
[11] Christopher Leckie,et al. Visualisation of power-law network topologies , 2003, The 11th IEEE International Conference on Networks, 2003. ICON2003..
[12] David Harel,et al. A fast multi-scale method for drawing large graphs , 2000, AVI '00.
[13] Michael Jünger,et al. Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm , 2004, GD.
[14] Tamara Munzner,et al. Visual Exploration of Complex Time-Varying Graphs , 2006 .