A multi-dimensional approach to force-directed layouts of large graphs

Computational Geometry: Theory and Applications

Volumn 29, Issue 1, 2004, Pages 3-18

  Gajer, Pawel ^a   Goodrich, Michael T ^b   Kobourov, Stephen G ^c  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c University of Arizona   (United States)

Author keywords

Force directed method; High dimensional embedding; Large graph drawing; Multi scale method

Indexed keywords

EID: 3242722008     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.03.014     Document Type: Article

References (47)

1. J. Barnes, and P. Hut A hierarchical O(NlogN) force calculation algorithm Nature 324 1986 446 449 Technical Report
2. T.C. Biedl Three approaches to 3D-orthogonal box-drawings Proceedings of the 6th Symposium on Graph Drawing (GD) Lecture Notes in Computer Science vol. 1547 1998 Springer-Verlag Berlin 30 43
3. A. Brandt Multilevel computations of integral transforms and particle interactions with oscillatory kernels Comput. Phys. Comm. 65 1991 24 38 (Pubitemid 21665553)
4. A. Brandt Multigrid methods in lattice field computations Nucl. Phys. B 26 1992 137 180 Proc. Suppl
5. I. Bruß, and A. Frick Fast interactive 3-D graph visualization F.J. Brandenburg, Proceedings of the 3rd Symposium on Graph Drawing (GD) Lecture Notes Computer Science vol. 1027 1996 Springer-Verlag Berlin 99 110
6. J.D. Cohen Drawing graphs to convey proximity: An incremental arrangement method ACM Trans. Computer-Human Interaction 4 3 1997 197 229
7. R.F. Cohen, P. Eades, T. Lin, and F. Ruskey Three-dimensional graph drawing Algorithmica 17 1997 199 208 (Pubitemid 127440915)
8. T.H. Cormen, C.E. Leiserson, and R.L. Rivest Introduction to Algorithms 1990 MIT Press Cambridge, MA
9. I.F. Cruz, and J.P. Twarog 3d graph drawing with simulated annealing F.J. Brandenburg, Proceedings of the 3rd Symposium on Graph Drawing (GD) Lecture Notes Computer Science vol. 1027 1996 Springer-Verlag Berlin 162 165 (Pubitemid 126025084)
10. R. Davidson, and D. Harel Drawing graphics nicely using simulated annealing ACM Trans. Graph. 15 4 1996 301 331 (Pubitemid 126418648)
11. G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis Graph Drawing: Algorithms for the Visualization of Graphs 1999 Prentice Hall Englewood Cliffs, NJ
12. C.A. Duncan, M.T. Goodrich, and S.G. Kobourov Balanced aspect ratio trees and their use for drawing large graphs J. Graph Alg. Appl. 4 2000 19 46 (Pubitemid 39064653)
13. P. Eades A heuristic for graph drawing Congr. Numer. 42 1984 149 160
14. P. Eades, and Q. Feng Multilevel visualization of clustered graphs Proceedings of the 4th Symposium on Graph Drawing (GD) Lecture Notes in Computer Science vol. 1190 1996 Springer-Verlag Berlin 101 112 (Pubitemid 127024204)
15. P. Eades, Q. Feng, and X. Lin Straight-line drawing algorithms for hierarchical graphs and clustered graphs Proceedings of the 4th Symposium on Graph Drawing (GD) Lecture Notes in Computer Science vol. 1190 1996 Springer-Verlag Berlin 113 128 (Pubitemid 127024205)
16. P. Eades, A. Symvonis, and S. Whitesides Two algorithms for three dimensional orthogonal graph drawing S. North, Proceedings of the 4th Symposium on Graph Drawing (GD) Lecture Notes in Computer Science vol. 1190 1996 Springer-Verlag Berlin 139 154
17. Q. Feng, Algorithms for drawing clustered graphs, PhD Thesis, Department of Computer Science and Software Engineering, University of Newcastle, 1997
18. Q. Feng, R.F. Cohen, and P. Eades How to draw a planar clustered graph Proc. 1st Annual International Conference on Computing and Combinatorics (COCOON '95) 1995 21 31
19. A. Frick, A. Ludwig, and H. Mehldau A fast adaptive layout algorithm for undirected graphs R. Tamassia, I.G. Tollis, Proceedings of the 2nd Symposium on Graph Drawing (GD) Lecture Notes in Computer Science vol. 894 1995 Springer-Verlag Berlin 388 403
20. T. Fruchterman, and E. Reingold Graph drawing by force-directed placement Softw. - Pract. Exp. 21 11 1991 1129 1164
21. G.W. Furnas Generalized fisheye views Proceedings of ACM Conference on Human Factors in Computing Systems (CHI'86) 1986 16 23
22. P. Gajer, and S.G. Kobourov GRIP: Graph dRawing with Intelligent Placement J. Graph Alg. Appl. 6 3 2002 203 224 (Pubitemid 39064679)
23. E.R. Gansner, and S.C. North Improved force-directed layouts Lecture Notes in Computer Science Lecture Notes in Computer Science vol. 1547 1998 Springer-Verlag Berlin 364 373
24. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman New York
25. T.F. Gonzalez Clustering to minimize the maximum intercluster distance Theoret. Comput. Sci. 38 2-3 1985 293 306
26. Hadany, and D. Harel A multi-scale algorithm for drawing graphs nicely DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 113 2001
27. D. Harel, and Y. Koren A fast multi-scale method for drawing large graphs Proceedings of the 8th Symposium on Graph Drawing (GD) Lecture Notes in Computer Science vol. 1984 2000 Springer-Verlag Berlin 183 196
28. D.S. Hochbaum, and D.B. Shmoys A unified approach to approximate algorithms for bottleneck problems J. ACM 33 3 1986 533 550
29. T. Kamada, S. Kawai, Automatic display of network structures for human understanding, Technical Report 88-007, Dept. of Inf. Science, University of Tokyo, 1988
30. M. Kaufmann, and D. Wagner Drawing Graphs: Methods and Models Lecture Notes in Computer Science vol. 2025 2001 Springer-Verlag Berlin
31. K. Kaugars, J. Reinfelds, and A. Brazma A simple algorithm for drawing large graphs on small screens Proceedings of the 3rd Symposium on Graph Drawing (GD) Lecture Notes in Computer Science vol. 894 1995 Springer-Verlag Berlin 278 281
32. S.G. Kobourov, Visualizing large graphs, PhD Thesis, Johns Hopkins University, 2000
33. K. Misue, K. Sugiyama, An overview of diagram based idea organizer: D-ABDUCTOR, Research Report IIAS-RR-93-3E, Fujitsu Laboratories Ltd., 1993
34. B. Monien, F. Ramme, and H. Salmen A parallel simulated annealing algorithm for generating 3D layouts of undirected graphs Proceedings of the 3rd Symposium on Graph Drawing (GD) Lecture Notes in Computer Science vol. 1027 1996 Springer-Verlag Berlin 396 408 (Pubitemid 126025107)
35. D.I. Ostry, Some three-dimensional graph drawing algorithms, Master's Thesis, University of Newcastle, Newcastle, Australia, 1996
36. A. Papakostas, and I.G. Tollis Incremental orthogonal graph drawing in three dimensions Proceedings of the 5th Symposium on Graph Drawing (GD) Lecture Notes in Computer Science vol. 1353 1997 Springer-Verlag Berlin 52 63 (Pubitemid 128012893)
37. A. Quigley, and P. Eades FADE: graph drawing, clustering, and visual abstraction Proceedings of the 8th Symposium on Graph Drawing (GD) Lecture Notes in Computer Science vol. 1984 2000 Springer-Verlag Berlin 197 210 (Pubitemid 33243331)
38. A.J. Quigley, Large scale relational information visualization, clustering, and abstraction, PhD Thesis, University of Newcastle, Australia, 2001
39. N. Quinn, and M. Breur A force directed component placement procedure for printed circuit boards IEEE Trans. Circuits and Systems CAS-26 6 1979 377 388
40. M. Sarkar, and M.H. Brown Graphical fisheye views Comm. ACM 37 12 1994 73 84
41. K. Sugiyama, and K. Misue Visualization of structural information: Automatic drawing of compound digraphs IEEE Trans. Systems Man Cybernet. 21 4 1991 876 892 (Pubitemid 23616561)
42. D. Tunkelang JIGGLE: Java interactive general graph layout environment Proceedings of the 6th Symposium on Graph Drawing (GD) Lecture Notes in Computer Science vol. 1547 1998 Springer-Verlag Berlin 413 422
43. C. Walshaw A multilevel algorithm for force-directed graph drawing Proceedings of the 8th Symposium on Graph Drawing (GD) Lecture Notes in Computer Science vol. 1984 2000 Springer-Verlag Berlin 171 182
44. C. Ware Information Visualization 2000 Morgan Kaufmann
45. C. Ware, D. Hui, and G. Franck Visualizing object oriented software in three dimensions CASCON 1993 Proceedings 1993
46. C.D. Wickens Engineering Psychology and Human Performance 1991 Harper Collins New York
47. D.R. Wood Multi-dimensional orthogonal graph drawing with small boxes Proceedings of the 7th Symposium on Graph Drawing (GD) Lecture Notes in Computer Science vol. 1731 1999 Springer-Verlag Berlin 311 322.