Advertisement

JIGGLE: Java Interactive Graph Layout Environment

  • Daniel Tunkelang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1547)

Abstract

JIGGLE is a Java-based platform for experimenting with numerical optimization approaches to general graph layout. It can draw graphs with undirected edges, directed edges, or a mix of both. Its features include an implementation of the Barnes-Hut tree code to quickly compute inter-node repulsion forces for large graphs and an optimization procedure based on the conjugate gradient method. JIGGLE can be accessed on the World Wide Web at http://www.cs.cmu.edu/~quixote.

Keywords

Line Search Undirected Graph Steep Descent Conjugate Gradient Method Directed Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [BETT94]
    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.zbMATHMathSciNetGoogle Scholar
  2. [BH86]
    J. Barnes and P. Hut, “A Hierarchical O(N log N) force-calculation algorithm,” Nature, vol. 324, pp. 446–449, 1986.CrossRefGoogle Scholar
  3. [CP96]
    M. Coleman and D. Parker, “Aesthetics-based Graph Layout for Human Consumption,” Software—Practice and Experience, vol. 26, pp. 1415–1438, 1996.CrossRefGoogle Scholar
  4. [DH96]
    R. Davidson and D. Harel, “Drawing Graphs Nicely Using Simulated Annealing,” ACM Transactions on Graphics, vol. 15, no. 4, pp. 301–331, 1996.CrossRefGoogle Scholar
  5. [Ea84]
    P. Eades, “A Heuristic for Graph Drawing,” Congressus Numerantium, vol. 42, pp. 149–160, 1984.MathSciNetGoogle Scholar
  6. [FLM94]
    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.Google Scholar
  7. [FR91]
    T. Fruchterman and E. Reingold, “Graph Drawing by Force-Directed Placement,” Software— Practice and Experience, vol. 21, no. 11, pp. 1129–1164, 1991.CrossRefGoogle Scholar
  8. [GJ83]
    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.zbMATHMathSciNetCrossRefGoogle Scholar
  9. [GKNV93]
    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.Google Scholar
  10. [GMW81]
    P. Gill, W. Murray, and M. Wright, Practical Optimization, Academic Press, London, 1981.zbMATHGoogle Scholar
  11. [GR87]
    L. Greengard and V. Rokhlin, “A Fast Algorithm for Particle Simulations,” Journal of Computational Physics, vol. 73, pp. 325–348, 1987.zbMATHCrossRefMathSciNetGoogle Scholar
  12. [Ig95]
    J. Ignatowicz, “Drawing Force-Directed Graphs using Optigraph,” in Proceedings of Graph Drawing’ 95, pp. 333–336.Google Scholar
  13. [KK89]
    T. Kamada and S. Kawai, “An Algorithm for Drawing General Undirected Graphs,” Information Processing Letters, vol. 31, pp. 7–15, 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  14. [Mo95]
    D. Moore, “The Cost of Balancing Generalized Quadtrees,” Technical Report COMP TR95-246, Rice University, Department of Computer Science, 1995.Google Scholar
  15. [Sh94]
    J. Shewchuk, “An Introduction to the Conjugate Gradient Method without the Agonizing Pain,” Carnegie Mellon University, School of Computer Science, unpublished draft.Google Scholar
  16. [SM94]
    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.Google Scholar
  17. [STT81]
    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.Google Scholar
  18. [Tu94]
    D. Tunkelang, “A Practical Approach to Drawing Undirected Graphs,” Technical Report CMU-CS-94-161, Carnegie Mellon University, School of Computer Science, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Daniel Tunkelang
    • 1
  1. 1.Carnegie Mellon UniversityUSA

Personalised recommendations