JIGGLE: Java interactive graph layout environment

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

Volumn 1547, Issue , 1999, Pages 413-422

  Tunkelang, Daniel ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957867098     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37623-2_33     Document Type: Conference Paper

References (18)

1. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, “Algorithms for Drawing Graphs: An Annotated Bibliography,” Computational Geometry: Theory and Applications, vol. 4, pp. 235-282, 1994.
2. J. Barnes and P. Hut, “A Hierarchical O(N log N) force-calculation algorithm,” Nature, vol. 324, pp. 446-449, 1986.
3. M. Coleman and D. Parker, “Aesthetics-based Graph Layout for Human Consumption,” Software-Practice and Experience, vol. 26, pp. 1415-1438, 1996.
4. R. Davidson and D. Harel, “Drawing Graphs Nicely Using Simulated Annealing,” ACM Transactions on Graphics, vol. 15, no. 4, pp. 301-331, 1996.
5. P. Eades, “A Heuristic for Graph Drawing,” Congressus Numerantium, vol. 42, pp. 149-160, 1984.
6. A. Frick, A. Ludwig, and H. Mehldau, “A Fast Adaptive Layout Algorithm for Undirected Graphs,” in Proceedings of Graph Drawing’94, pp. 388-403, 1994.
7. T. Fruchterman and E. Reingold, “Graph Drawing by Force-Directed Placement,” Software— Practice and Experience, vol. 21, no. 11, pp. 1129-1164, 1991.
8. M. Garey and D. Johnson, “Crossing Number is NP-Complete,” SIAM Journal on Algebraic and Discrete Methods, vol. 4, no. 3, pp. 312-316, 1983.
9. E. Gansner, E. Koutsofios, S. North, and K. Vo, “A Technique for Drawing Directed Graphs,” IEEE Transactions on Software Engineering, vol. 19, no. 3, 1993.
10. P. Gill, W. Murray, and M. Wright, Practical Optimization, Academic Press, London, 1981.
11. L. Greengard and V. Rokhlin, “A Fast Algorithm for Particle Simulations,” Journal of Computational Physics, vol. 73, pp. 325-348, 1987.
12. J. Ignatowicz, “Drawing Force-Directed Graphs using Optigraph,” in Proceedings of Graph Drawing’95, pp. 333-336.
13. T. Kamada and S. Kawai, “An Algorithm for Drawing General Undirected Graphs,” Information Processing Letters, vol. 31, pp. 7-15, 1989.
14. D. Moore, “The Cost of Balancing Generalized Quadtrees,” Technical Report COMP TR95-246, Rice University, Department of Computer Science, 1995.
15. J. Shewchuk, “An Introduction to the Conjugate Gradient Method without the Agonizing Pain,” Carnegie Mellon University, School of Computer Science, unpublished draft.
16. K. Sugiyama and K. Misue, “A Simple and Unified Method for Drawing Graphs: Magnetic- Spring Algorithm,” in Proceedings of Graph Drawing’94, pp. 364-375.
17. K. Sugiyama, S. Tagawa, and M. Toda, “Methods for Visual Understanding of Hierarchical System Structures,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 11, no. 2, 1981.
18. D. Tunkelang, “A Practical Approach to Drawing Undirected Graphs,” Technical Report CMUCS- 94-161, Carnegie Mellon University, School of Computer Science, 1994.