A fast algorithm for particle simulations
Journal of Computational Physics
An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
Aesthetics-based graph layout for human consumption
Software—Practice & Experience
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
Drawing Force-Directed Graphs Using Optigraph
GD '95 Proceedings of the Symposium on Graph Drawing
A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
A Fast Adaptive Layout Algorithm for Undirected Graphs
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
An Introduction to the Conjugate Gradient Method Without the Agonizing Pain
An Introduction to the Conjugate Gradient Method Without the Agonizing Pain
A Practical Approach to Drawing Undirected Graphs
A Practical Approach to Drawing Undirected Graphs
Travel Planning with Self-Made Maps
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
FADE: Graph Drawing, Clustering, and Visual Abstraction
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Multilevel Algorithm for Force-Directed Graph Drawing
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Generating node coordinates for shortest-path computations in transportation networks
Journal of Experimental Algorithmics (JEA)
A multi-dimensional approach to force-directed layouts of large graphs
Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
Mapping and visualizing the internet
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
GD'06 Proceedings of the 14th international conference on Graph drawing
An experimental comparison of fast algorithms for drawing general large graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Drawing large graphs with a potential-field-based multilevel algorithm
GD'04 Proceedings of the 12th international conference on Graph Drawing
Planar preprocessing for spring embedders
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
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 internode 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.