A new force-directed graph drawing method based on edge-edge repulsion

Proceedings of the International Conference on Information Visualisation

Volumn 2005, Issue , 2005, Pages 329-334

  Lin, Chun Cheng ^a   Yen, Hsu Chun ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Angular resolution; Force directed method; Potential field

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; DRAWING (GRAPHICS); OPTICAL RESOLVING POWER;

ANGULAR RESOLUTION; FORCE-DIRECTED METHOD; POTENTIAL FIELD; SYMMETRICAL DRAWINGS;

GRAPH THEORY;

EID: 33749055709     PISSN: 10939547     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IV.2005.10     Document Type: Conference Paper

References (9)

1. F. Bertault. A force-directed algorithm that preserves edge crossing properties. In Graph Drawing '99, pages 351-358. LNCS, Vol. 1731, Springer-Verlag, 1999.
2. J.-H. Chuang and N. Ahuja. An analytically tractable potential field model of free space and its application in obstacle avoidance. IEEE Transactions on System, Man, and Cybernetics, 28(5):729-736, 1998.
3. J.-H. Chuang, C.-C. Lin, and H.-C. Yen. Drawing graphs with nonuniform nodes using potential fields. In Graph Drawing 2003, pages 460-465. LNCS, Vol. 2912, Springer-Verlag, 2004.
4. R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, 15:301-331, 1996.
5. P. Eades. A heuristic for graph drawing. Congress Numerantium, 42:149-160, 1984.
6. P. Eades and X. Lin. Spring algorithms and symmetry. Theoretical Computer Science, 240(2):379-405, 2000.
7. M. Formann, J. Haralambides, M. Kaufmann, F. T. Leighton, A. Simvonis, E. Welzl, and G. Woeginger. Drawing graphs in the plane with high resolution. SIAM Journal on Computing, 22(5):1035-1052, 1993.
8. T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, 21:1129-1164, 1991.
9. Mathworld. Introduction to hypercubes. http://mathworld.wolfram.com/Hypercube.html.