JIGGLE: Java Interactive Graph Layout Environment
暂无分享,去创建一个
[1] David Harel,et al. Drawing graphs nicely using simulated annealing , 1996, TOGS.
[2] Doug Moore. The cost of balancing generalized quadtrees , 1995, SMA '95.
[3] Mitsuhiko Toda,et al. Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.
[4] Daniel Tunkelang. A Practical Approach to Drawing Undirected Graphs , 1994 .
[5] David S. Johnson,et al. Crossing Number is NP-Complete , 1983 .
[6] Andreas Ludwig,et al. A Fast Adaptive Layout Algorithm for Undirected Graphs , 1994, GD.
[7] Philip E. Gill,et al. Practical optimization , 1981 .
[8] Edward M. Reingold,et al. Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..
[9] Peter Eades,et al. A Heuristic for Graph Drawing , 1984 .
[10] Satoru Kawai,et al. An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..
[11] Emden R. Gansner,et al. A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..
[12] J. Shewchuk. An Introduction to the Conjugate Gradient Method Without the Agonizing Pain , 1994 .
[13] Piet Hut,et al. A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.
[14] Leslie Greengard,et al. A fast algorithm for particle simulations , 1987 .
[15] Ioannis G. Tollis,et al. Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..
[16] Jovanna Ignatowicz. Drawing Force-Directed Graphs Using Optigraph , 1995, Graph Drawing.
[17] Kozo Sugiyama,et al. A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm , 1994, GD.
[18] D. Stott Parker,et al. Aesthetics-Based Graph Layout for Human Consumption , 1996, Softw. Pract. Exp..