JIGGLE: Java Interactive Graph Layout Environment

Tunkelang, Daniel (1998) JIGGLE: Java Interactive Graph Layout Environment. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 413-422 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_33).

Full text not available from this repository.

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.

Item Type:Conference Paper
Additional Information:10.1007/3-540-37623-2_33
Classifications:S Software and Systems > S.001 General
ID Code:416

Repository Staff Only: item control page

References

G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Algorithms for drawing graphs: An annotated bibliography. Comput. Geom. Theory Appl., 4: 235-282, 1994.

J. Barnes and P. Hut. A hierarchical O (N log N) force-calculation algorithm. Nature, vol. 324, pages 446-449, 1986.

M. Coleman and D. Parker. Aesthetics-based Graph Layout for Human Consumption. Software-Practice and Experience, vol. 26, pages 1415-1438, 1996.

R. Davidson and D. Harel. Drawing graphs nicely using simmulated annealing. Technical report, Dept. of Appl. Math. and Comp. Sci., 1991.

P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.

A. Frick, A. Ludwig, and H. Mehldau. A fast adaptive layout algorithm for undirected graphs. In Proceedings of DIMACS International Workshop on GD '94, LNCS 894, pages 388-403, Princeton, New Jersey, USA, October 1994. Springer-Verlag.

T.M.J. Fruchtermann and E.M. Reingold. Graph drawing by force-directed placement. Software Practice and Experience, 21(11):1129-1164, November 1991.

M.R. Garey and D.S. Johnson. Crossing number is np-complete, SIAM J. Algebraic and Discrete Methods 4(1983), 312-316.

E.R. Gansner, E. Koutsofios, S.C. North, and K. P. Vo. A technique for drawing directed graphs. IEEE Trans. Softw. Eng., 19:214-230, 1993.

P. Gill, W. Murray, and M. Wright. Practical optimization, Academic Press, London, 1981.

L. Greengard and V. Rokhlin. A fast algorithm for particle simulations. Journal of computational physiks, vol. 73, pages 325-348, 1987.

J. Ignatowicz. Drawing Force-Directed Graphs Using Optigraph, In Proc. of GD '95, LNCS, 1027, pages 333-336.

T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31(1):7-15, April 1989.

D. Moore. The Cost of Balancing Generalized Quadtrees, Technical Report COMP TR95-246, Rice University, Department of Computer Science, 1995.

J. Shewchuk. An Introduction to the Conjugate Gradient Method without the Agonizing Pain, Carnegie Mellon University, School of Computer Science, unpublished draft.

K. Sugiyama and K. Misue. A simple and unified method for drawing graphs: magnetic-spring algorithm. In Proceedings of DIMACS International Workshop on GD '94, LNCS 894, Princeton, New Jersey, USA, October 1994. Springer-Verlag.

K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. Syst. Man. Cybern., SMC-11(2):109-125, 1981.

D. Tunkelang. A practical approach to drawing undirected graphs. Technical Report CMU-CS-94-161, Carnegie Mellon University, School of Computer Science, 1994.