Aesthetic of angular resolution for node-link diagrams: Validation and algorithm
暂无分享,去创建一个
[1] Peter Rodgers,et al. Applying graphical design techniques to graph visualisation , 2005, Ninth International Conference on Information Visualisation (IV'05).
[2] Weidong Huang,et al. Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics , 2010, 2010 IEEE Symposium on Visual Languages and Human-Centric Computing.
[3] B. Hayes. Graph Theory in Practice: Part II , 2000, American Scientist.
[4] Kang Zhang,et al. Node overlap removal in clustered directed acyclic graphs , 2009, J. Vis. Lang. Comput..
[5] David Eppstein,et al. A steady state model for graph power laws , 2002, ArXiv.
[6] Kim Marriott,et al. Drawing directed graphs using quadratic programming , 2006, IEEE Transactions on Visualization and Computer Graphics.
[7] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[8] Kim Marriott,et al. Integrating Edge Routing into Force-Directed Layout , 2006, GD.
[9] Roberto Tamassia,et al. Curvilinear Graph Drawing Using the Force-Directed Method , 2004, GD.
[10] Edward M. Reingold,et al. Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..
[11] Weidong Huang,et al. How People Read Graphs , 2005, APVIS.
[12] Hsu-Chun Yen,et al. A new force-directed graph drawing method based on edge-edge repulsion , 2005, Ninth International Conference on Information Visualisation (IV'05).
[13] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.