Aesthetic of angular resolution for node-link diagrams: Validation and algorithm

Proceedings - 2011 IEEE Symposium on Visual Languages and Human Centric Computing, VL/HCC 2011

Volumn , Issue , 2011, Pages 213-216

  Huang, Weidong ^a,b   Huang, Maolin ^a   Lin, Chun Cheng ^c  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^b CSIRO   (Australia)

^c NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

aesthetics; angular resolution; evaluation; force directed algorithm; graph drawing; node link diagram

Indexed keywords

AESTHETICS; ANGULAR RESOLUTION; EVALUATION; FORCE DIRECTED ALGORITHMS; GRAPH DRAWING; NODE-LINK DIAGRAMS;

DRAWING (GRAPHICS);

ALGORITHMS;

EID: 82855181154     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/VLHCC.2011.6070402     Document Type: Conference Paper

References (14)

1. Taylor, M. and Rodgers, P. (2005) Applying Graphical Design Techniques to Graph Visualization. In Proc. IV'05, 651-656.
2. Di Battista, G., Eades, P., Tamassia, R. and Tollis, I. (1998) Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall.
3. Huang, W., Eades, P., Hong, S.H. and Lin, C.C. (2010) Improving Force-Directed Graph Drawings by Making Compromises between Aesthetics. In Proc.VL/HCC'10, 176-183.
4. Dwyer, T., Marriott, K. and Wybrow, M. (2007) Integrating edge routing into force-directed layout. In Proc. GD'06, 8-19.
5. Dwyer, T., Koren, Y. and Marriott, K. (2006) Drawing directed graphs using quadratic programming. IEEE Transactions on Visualization and Computer Graphics, 12(4): 536-548. (Pubitemid 43824566)
6. Kumar, P. and Zhang, K. (2009) Node Overlap Removal in Clustered Directed Acyclic Graphs. Journal of Visual Languages and Computing, 20 (6): 403-419.
7. Lin, C.C. and Yen, H.C. (2005) A New Force-Directed Graph Drawing Method Based on Edge-Edge Repulsion. In Proc. IV'05, 329-334.
8. Finkel, B. and Tamassia, R. (2004) Curvilinear graph drawing using the force-directed method. In Proc. GD'04, 448-453.
9. Fruchterman, T. and Reingold, E.M. (1991) Graph Drawing by Force-Directed Placement. Software - Practice and Experience, 21: 1129-1164.
10. Watts, D.J. and Strogatz, S. (1998) Collective Dynamics of Small World Networks. Nature, 393: 440-442.
11. Eppstein, D. and Wang, J.Y. (2002) A steady state model for graph power laws. In Proc. 2nd International Workshop on Web Dynamics.
12. Erdos, P. and Renyi, A. (1959) On Random Graphs. Publicationes Mathematicae, 6: 290-297.
13. Hayes, B. (2000) Graph Theory in Practice: Part II. American Scientist, 88(2): 104. The Scientific Research Society.
14. Huang, W. and Eades, P. (2005) How people read graphs. In Proc. APVIS'05, 51-58.