Drawing graphs with nonuniform nodes using potential fields

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2912, Issue , 2004, Pages 460-465

  Chuang, Jen Hui ^a   Lin, Chun Cheng ^b   Yen, Hsu Chun ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); MOTION PLANNING;

FORCE-DIRECTED METHOD; NEW APPROACHES; POTENTIAL FIELD; REPULSIVE FORCES;

DIRECTED GRAPHS;

EID: 84956704500     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24595-7_43     Document Type: Conference Paper

References (6)

1. D. Harel and Y. Koren. Drawing graphs with non-uniform vertices. Proc. of Working Conference on Advanced Visual Interfaces (AVI’02), pp. 157–166, ACM Press, 2002.
2. P. Eades. A heuristic for graph drawing. Congress Numerantium, 42, pp. 149–160, 1984.
3. 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 - Part B: Cybernetics, Vol. 28, No. 5, pp. 729 –736, Oct, 1998.
4. J.-H Chuang. Potential-based modeling of three-dimensional workspace for obstacle avoidance. IEEE Trans. Robotics and Automation, Vol. 14, No. 5, pp. 778–785, Oct. 1998.
5. P. Eades and M. L. Huang. Navigating clustered graphs using force-directed methods. Journal of Graph Algorithms and Applications, Vol. 4, No. 3, pp. 157–181, 2000.
6. M. Huang, P. Eades and J. Wang. On-line animated visualization of huge graphs using a modified spring algorithm. Journal of Visual Languages and Computing, pp. 623–345, 1998.