ImPrEd: An improved force-directed algorithm that prevents nodes from crossing edges

Computer Graphics Forum

Volumn 30, Issue 3, 2011, Pages 1071-1080

  Simonetto, Paolo ^a   Archambault, Daniel ^b   Auber, David ^a   Bourqui, Romain ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITY COLLEGE DUBLIN   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ANGULAR DISTRIBUTION; DRAWING (GRAPHICS); ECONOMIC AND SOCIAL EFFECTS;

ANGULAR RESOLUTION; CROSSING EDGES; DATA SET SIZE; EDGE CROSSING; EULER DIAGRAMS; FORCE DIRECTED ALGORITHMS; NODE MOVEMENT; SMOOTH BOUNDARY;

DIRECTED GRAPHS;

EID: 84867660594     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/j.1467-8659.2011.01956.x     Document Type: Article

References (27)

1. BOITMANIS K., BRANDES U., PICH C.: Visualizing internet evolution on the autonomous systems level. In International Symposium on Graph Drawing (GD07) (2008), Hong S.-H., Nishizeki T., Quan W., (Eds.), vol. 4875 of Lecture Notes in Computer Science, Springer, pp. 365-376.
2. BERTAULT F.: A force-directed algorithm that preserves edge crossing properties. Information Processing Letters 74, 1-2 (Apr. 2000), 7-13.
3. DE BERG M., CHEONG O., VAN KREVELD M., OVERMARS M.: Computational Geometry: Algorithms and Applications. Springer-Verlag, 2000.
4. DI BATTISTA G., EADES P., TAMASSIA R., TOLLIS I. G.: Graph Drawing; Algorithms for the Visualization of Graphs. Prentice Hall, July 1998.
5. DE FRAYSSEIX H., OSSONA DE MENDEZ P.: Public implementation of a graph algorithm library and editor (PIGALE), 2002. http://pigale.sourceforge.net.
6. DE FRAYSSEIX H., PACH J., POLLACK R.: How to draw a planar graph on a grid. Combinatorica 10, 1 (1990), 41-51.
7. DWYER T., KOREN Y.: Dig-CoLa: Directed graph layout through constrained energy minimization. In IEEE Symposium on Information Visualization (InfoVis05) (2005), Ward M., Stasko J., (Eds.), IEEE Computer Society, pp. 65-72.
8. DWYER T., KOREN Y., MARRIOTT K.: IPSep-CoLa: An incremental procedure for separation constraint layout of graphs. IEEE Transactions on Visualization and Computer Graphics (InfoVis06) 12, 5 (Sept. 2006), 821-828.
9. DIDIMO W., LIOTTA G., ROMEO S. A.: Topologydriven force-directed algorithms. In International Symposium on Graph Drawing (GD10) (2011), Brandes U., Cornelsen S., (Eds.), vol. 6502 of Lecture Notes in Computer Science, Springer, pp. 165-176.
10. DWYER T., MARRIOTT K., WYBROW M.: Topology preserving constrained graph layout. In International Symposium on Graph Drawing (GD08) (2009), Tollis I. G., Patrignani M., (Eds.), vol. 5417 of Lecture Notes in Computer Science, Springer, pp. 230-241.
11. DWYER T.: Scalable, versatile and simple constrained graph layout. Computer Graphics Forum (EuroVis09) 28, 3 (June 2009), 991-998.
12. EADES P.: A heuristic for graph drawing. Congressus numerantium 42 (1984), 149-160.
13. ERTEN C., HARDING P. J., KOBOUROV S. G., WAMPLER K., YEE G. V.: GraphAEL: Graph animations with evolving layouts. In International Symposium on Graph Drawing (GD03) (2004), Liotta G., (Ed.), vol. 2912 of Lecture Notes in Computer Science, Springer, pp. 98-110.
14. FRICK A., LUDWIG A., MEHLDAU H.: A fast adaptive layout algorithm for undirected graphs. In International Symposium on Graph Drawing (GD94) (1995), Tamassia R., Tollis I. G., (Eds.), vol. 894 of Lecture Notes in Computer Science, Springer, pp. 388-403.
15. FRUCHTERMAN T. M., REINGOLD E. M.: Graph drawing by force-directed placement. Software: Practice and Experience 21, 11 (Nov. 1991), 1129-1164.
16. FRISHMAN Y., TAL A.: Dynamic drawing of clustered graphs. In IEEE Symposium on Information Visualization (InfoVis04) (2004), Ward M., Munzner T., (Eds.), IEEE Computer Society, pp. 191-198.
17. FRISHMAN Y., TAL A.: Online dynamic graph drawing. IEEE Transactions on Visualization and Computer Graphics 14, 4 (2008), 727-740.
18. GANSNER E. R., HU Y., KOBOUROV S.: GMap: Visualizing graphs and clusters as maps. In IEEE Pacific Visualization Symposium (PacificVis10) (2010), North S., Shen H.-W., van Wijk J., (Eds.), IEEE Computer Society, pp. 201-208.
19. GUTWENGER C., MUTZEL P.: Planar polyline drawings with good angular resolution. In International Symposium on Graph Drawing (GD98) (1998), Whitesides S., (Ed.), vol. 1547 of Lecture Notes in Computer Science, Springer, pp. 167-182.
20. HERMAN I., MELANÇON G., MARSHALL M. S.: Graph visualization and navigation in information visualization: A survey. IEEE Transactions on Visualization and Computer Graphics 6, 1 (2000), 24-43.
21. ITOH T., MUELDER C., MA K.-L., SESE J.: A hybrid space-filling and force-directed layout method for visualizing multiple-category graphs. In IEEE Pacific Visualization Symposium (PacificVis09) (2009), Eades P., Ertl T., Shen H.-W., (Eds.), IEEE Computer Society, pp. 121-128.
22. NISHIZEKI T., RAHMAN M. S.: Planar Graph Drawing, vol. 12 of Lecture Notes Series on Computing. World Scientific, Sept. 2004.
23. PURCHASE H. C.: Which aesthetic has the greatest effect on human understanding? In International Symposium on Graph Drawing (GD97) (1997), Di Battista G., (Ed.), vol. 1353 of Lecture Notes in Computer Science, Springer, pp. 248-261.
24. QUIGLEY A., EADES P.: FADE: Graph drawing, clustering, and visual abstraction. In International Symposium on Graph Drawing (GD00) (2001), Marks J., (Ed.), vol. 1984 of Lecture Notes in Computer Science, Springer, pp. 197-210.
25. SIMONETTO P., AUBER D., ARCHAMBAULT D.: Fully automatic visualisation of overlapping sets. Computer Graphics Forum (EuroVis09) 28, 3 (June 2009), 967-974.
26. SAFFREY P., PURCHASE H. C.: The "mental map" versus "static aesthetic" compromise in dynamic graphs: A user study. In Australasian User Interface Conference (AUIC08) (Jan. 2008), Plimmer B.,Weber G., (Eds.), vol. 76 of Conferences in Research and Practice in Information Technology, Australian Computer Society, pp. 85-93.
27. VAN HAM F., VAN WIJK J. J.: Interactive visualization of small world graphs. In IEEE Symposium on Information Visualization (InfoVis04) (2004), Ward M., Munzner T., (Eds.), IEEE Computer Society, pp. 199-206.