Extending the spring-electrical model to overcome warping effects

IEEE Pacific Visualization Symposium, PacificVis 2009 - Proceedings

Volumn , Issue , 2009, Pages 129-136

  Hu, Yifan ^a   Koren, Yehuda ^b  

^a AT AND T LABS RESEARCH   (United States)

^b YAHOO RESEARCH   (United States)

Author keywords

Force directed methods; G.2.2 discrete mathematics : Graph theory graph algorithms; Graph drawing; Warping effect

Indexed keywords

EDGE LENGTH; ELECTRICAL MODELS; FORCE DIRECTED ALGORITHMS; FORCE DIRECTED METHODS; G.2.2 [DISCRETE MATHEMATICS]: GRAPH THEORY - GRAPH ALGORITHMS; GLOBAL STRUCTURE; GRAPH DRAWING; LARGE GRAPHS; LAYOUT QUALITY; NONUNIFORM; PRACTICAL EXPERIENCE; STRESS MODELS; UNDIRECTED GRAPH; WARPING EFFECT; WARPING EFFECTS;

ALGORITHMS; DRAWING (GRAPHICS); THIN WALLED STRUCTURES; VISUALIZATION; WEAVING;

GRAPH THEORY;

EID: 67650515445     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACIFICVIS.2009.4906847     Document Type: Conference Paper

References (30)

1. A. T. Ada, S. V. Date, S. Wieland, and E. M. Marcotte. LGL: creating a map of protein function with an algorithm for visualizing very large biological networks. Journal of Molecular Biology, 340:440-442, 1998.
2. J. Barnes and P. Hut. A hierarchical O(NlogN) force-calculation algorithm. Nature, 324:446-449, 1986.
3. U. Brandes, V. Kaab, A. Loh, D. Wagner, and T. Willhalm. Dynamic www structures in 3d. Journal of Graph Algorithms and Applications, 4:2000, 2000.
4. U. Brandes and C. Pich. An experimental study on distance based graph drawing. In GD'08: Proceedings of the Symposium on Graph Drawing, 2008 (to appear).
5. I. Bruss and A. Frick. Fast interactive 3-D graph visualization. LNCS, 1027:99-111, 1995.
6. B. Cheswick, B. Burch, and S. Branigan. Mapping and visualizing the internet. In Proceeding of USENIX Annual Technical Conference, 2000.
7. T. Davis. The university of florida sparse matrix collection. http://www.cise.ufl.edu/research/sparse/matrices.
8. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
9. Y. Frishman and A. Tal. Online dynamic graph drawing. In proceeding of Eurographics/IEEE VGTC Symposium on Visualization (EuroVis), pages 75-82, 2007.
10. T. M. J. Fruchterman and E. M. Reingold. Graph drawing by force directed placement. Software - Practice and Experience, 21:1129-1164, 1991.
11. P. Gajer, M. T. Goodrich, and S. G. Kobourov. A fast multidimensional algorithm for drawing large graphs. LNCS, 1984:211 - 221, 2000.
12. E. R. Gansner and Y. F. Hu. Efficient node overlap removal using a proximity stress model. In GD'08: Proceedings of the Symposium on Graph Drawing, 2008 (to appear).
13. E. R. Gansner, Y. Koren, and S. North. Topological fisheye views for visualizing large graphs. IEEE Transactions on Visualization and Computer Graphics, 11:457-468, 2005. (Pubitemid 41049907)
14. E. R. Gansner, Y. Koren, and S. C. North. Graph drawing by stress majorization. In Proc. 12th Intl. Symp. Graph Drawing (GD '04), volume 3383 of LNCS, pages 239-250. Springer, 2004.
15. G. H. Golub and C. F. V. Loan. Matrix Computations (Johns Hopkins Studies in Mathematical Sciences). The Johns Hopkins University Press, 1996.
16. S. Hachul and M. Jünger. Drawing large graphs with a potential field based multilevel algorithm. In Proc. 12th Intl. Symp. Graph Drawing (GD '04), volume 3383 of LNCS, pages 285-295. Springer, 2004.
17. D. Harel and Y. Koren. A fast multi-scale method for drawing large graphs. J. Graph Algorithms and Applications, 6:179-202, 2002.
18. Y. F. Hu. A gallery of large graphs. http://research.att.com/ ̃yifanhu/GALLERY/GRAPHS.
19. Y. F. Hu. Efficient and high quality force-directed graph drawing. Mathematica Journal, 10:37-71, 2005.
20. Y. F. Hu. Visualizing graphs with node and edge labels. manuscript, 2008.
21. J. W. Jaromczyk and G. T. Toussaint. Relative neighborhood graphs and their relatives. Proc. IEEE, 80:1502-1517, 1992. (Pubitemid 23568838)
22. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7-15, 1989.
23. K. A. Lyons, H. Meijer, and D. Rappaport. Algorithms for cluster busting in anchored graph drawing. J. Graph Algorithms and Applications, 2(1), 1998.
24. A. Noack. An energy model for visual graph clustering. In Proceedings of the 11th International Symposium on Graph Drawing (GD 2003), volume 2912 of LNCS, pages 425-436. Springer, 2004.
25. A. Quigley and P. Eades. Fade: Graph drawing, clustering, and visual abstraction. LNCS, 1984:183-196, 2000.
26. J. R. Shewchuk. Engineering a 2D quality mesh generator and Delaunay triangulator. In Applied Computational Geometry: Towards Geo- metric Engineering, volume 1148 of LNCS, pages 203-222. Springer, 1996.
27. J. R. Shewchuk. Delaunay refinement algorithms for triangular mesh generation. Computational Geometry: Theory and Applications, 22:21-74, 2002.
28. D. Tunkelang. A Numerical Optimization Approach to General Graph Drawing. PhD thesis, Carnegie Mellow University, 1999.
29. C.Walshaw. A multilevel algorithm for force-directed graph drawing. J. Graph Algorithms and Applications, 7:253-285, 2003. (Pubitemid 39064694)
30. D. Watts and S. Strogate. Collective dynamics of "small-world" networks. Nature, 393:440-442, 1998.