A force-directed algorithm that preserves edge-crossing properties

Information Processing Letters

Volumn 74, Issue 1-2, 2000, Pages 7-13

  Bertault, François ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

Algorithms; Force directed method; Graph drawing

Indexed keywords

ALGORITHMS; ITERATIVE METHODS;

DYNAMIC GRAPHS; FORCE DIRECTED ALGORITHMS; PLANAR GRAPHS;

GRAPH THEORY;

EID: 0033728601     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(00)00042-9     Document Type: Article

References (9)

1. H. de Fraysseix, J. Pach, R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1990) 41-51.
2. G. Di Battista, P.D. Eades, R. Tamassia, I.G. Tollis, Graph Drawing, Prentice-Hall, Englewood Cliffs, NJ, 1999.
3. P. Eades, W. Lai, K. Misue, K. Sugiyama, Layout adjustment and the mental map, J. Visual Languages Comput. 6 (1995) 183-210.
4. P.D. Eades, A heuristic for graph drawing, Congr. Numer. 42 (1984) 149-160.
5. T. Fruchterman, E. Reingold, Graph drawing by force-directed placement, Software-Practice Exper. 21 (11) (1991) 1129-1164.
6. T. Kamada, S. Kawai, An algorithm for drawing general undirected graphs, Inform. Process. Lett. 31 (1989) 7-15.
7. G. Kant, Drawing planar graphs using the lmc-ordering, in: Proc. IEEE Symp. on Foundation of Computer Science, 1992, pp. 101-110.
8. G. Kant, H.L. Bodlaender, Triangulating planar graphs while minimizing the maximum degree, Inform, and Comput. 135 (1) (1997) 1-14.
9. P. Mutzel, A fast linear time embedding algorithm based on the Hopcropt-Tarjan planarity test, Technical Report, Institut für Informatik, Universität zu Köln, 1992.