GRIP: Graph Drawing with Intelligent Placement

Journal of Graph Algorithms and Applications

Volumn 6, Issue 3, 2002, Pages 203-224

  Gajer, Pawel ^a   Kobourov, Stephen G ^b  

^a Johns Hopkins University   (United States)

^b University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4043166921     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00052     Document Type: Conference Paper

References (20)

1. J. Barnes and P. Hut. A hierarchical O(N log N) force calculation algorithm. Nature, 324:446-449, Dec. 1986. Institute for Advanced Study, Princeton, New Jersey.
2. Brandes and Cornelsen. Visual ranking of link structures. In WADS: 7th Workshop on Algorithms and Data Structures, volume 2125 of Lecture Notes in Computer Science, pages 222-232, 2001.
3. I. Bruß and A. Frick. Fast interactive 3-D graph visualization. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Computer Science, pages 99-110. Springer-Verlag, 1996.
4. J. D. Cohen. Drawing graphs to convey proximity: An incremental arrangement method. ACM Transactions on Computer-Human Interaction, 4(3):197-229, Sept. 1997.
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
6. I. F. Cruz and J. P. Twarog. 3d graph drawing with simulated annealing. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Computer Science, pages 162-165, 1996.
7. R. Davidson and D. Harel. Drawing graphics nicely using simulated annealing. ACM Trans. Graph., 15(4):301-331, 1996.
8. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
9. A. Frick, A. Ludwig, and H. Mehldau. A fast adaptive layout algorithm for undirected graphs. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), LNCS 894, pages 388-403, 1995.
10. T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Softw. - Pract. Exp., 21(11):1129-1164, 1991.
11. P. Gajer, M. T. Goodrich, and S. G. Kobourov. A multi-dimensional approach to force-directed layouts. In Proceedings of the 8th Symposium on Graph Drawing (GD 2000), pages 211-221, 2000.
12. R. Hadany and D. Harel. A multi-scale algorithm for drawing graphs nicely. In Proc. 25th International Workshop on Graph Teoretic Concepts in Computer Science (WG'99), 1999.
13. D. Harel and Y. Koren. A fast multi-scale method for drawing large graphs. In Proceedings of the 8th Symposium on Graph Drawing (GD 2000), pages 183-196, 2000.
14. M. Himsolt. Gml: A portable graph file format. Technical report, Universität Passau, 1994.
15. T. Kamada and S. Kawai. Automatic display of network structures for human understanding. Technical Report 88-007, Department of Information Science, University of Tokyo, 1988.
16. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Inform. Process. Lett., 31:7-15, 1989.
17. D. E. Knuth. The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press, New York, NY 10036, USA, 1993.
18. B. B. Mandelbrot. The Fractal Geometry of Nature. W.H. Freeman and Co., New York, rev 1983.
19. A. Quigley and P. Eades. FADE: graph drawing, clustering, and visual abstraction. In Proceedings of the 8th Symposium on Graph Drawing (GD 2000), pages 197-210, 2000.
20. C. Walshaw. A multilevel algorithm for force-directed graph drawing. In Proceedings of the 8th Symposium on Graph Drawing (GD 2000), pages 171-182, 2000.