Efficient, proximity-preserving node overlap removal

Journal of Graph Algorithms and Applications

Volumn 14, Issue 1, 2010, Pages 53-74

  Gansner, Emden R ^a   Hu, Yifan ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

CORE PROBLEMS; POST-PROCESSING; PROCESSING STEPS; REMOVAL ALGORITHMS; STRUCTURAL INFORMATION;

GRAPH THEORY;

EID: 77955115496     PISSN: None     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00198     Document Type: Article

References (37)

1. I. Borg and P. Groenen. Modern Multidimensional Scaling: Theory and Applications. Springer, 1997.
2. 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).
3. J.-H. Chuang, C.-C. Lin, and H.-C. Yen. Drawing graphs with nonuniform nodes using potential fields. In Proc. 11th Intl. Symp. on Graph Drawing, volume 2012 of LNCS, pages 460-465. Springer-Verlag, 2003.
4. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. CGTA: Computational Geometry: Theory and Applications, 7:303-325, 1997.
5. T. Dwyer, Y. Koren, and K. Marriott. Ipsep-cola: An incremental procedure for separation constraint layout of graphs. IEEE Transactions on Visualization and Computer Graphics, 12(5):821-828, 2006.
6. T. Dwyer, K. Marriott, and P. J. Stuckey. Fast node overlap removal. In Proc. 13th Intl. Symp. Graph Drawing (GD '05), volume 3843 of LNCS, pages 153-164. Springer, 2006.
7. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160,1984.
8. H. Edelsbrunner and E. P. Mücke. Three-dimensional alpha shapes. ACM Trans. on Graphics, 13(1):43-72, 1994.
9. C. Erten, A. Efrat, D. Forrester, A. Iyer, and S. G. Kobourov. Force-directed approaches to sensor network localization. In R. Raman, R. Sedgewick, and M. F. Stallmann, editors, Proc. 8th Workshop Algorithm Engineering and Experiments (ALENEX), pages 108-118. SIAM, 2006.
10. S. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2:153-174, 1987.
11. C. Friedrich and F. Schreiber. Flexible layering in hierarchical drawings with nodes of arbitrary size. In Proceedings of the 27th conference on Australasian computer science (ACSC2004), pages 369-376. Australian Computer Society, 2004.
12. T. M. J. Fruchterman and E. M. Reingold. Graph drawing by force directed placement. Software - Practice and Experience, 21:1129-1164, 1991.
13. 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.
14. E. R. Gansner and S. North. An open graph visualization system and its applications to software engineering. Software - Practice & Experience, 30:1203-1233, 2000.
15. E. R. Gansner and S. C. North. Improved force-directed layouts. In Proc. 6th Intl. Symp. Graph Drawing (GD '98), volume 1547 of LNCS, pages 364-373. Springer, 1998.
16. J. C. Gower and G. B. Dijksterhuis. Procrustes Problems. Oxford University Press, 2004.
17. L. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of voronoi. ACM Trans. Graph., 4(2):74-123, 1985.
18. 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.
19. D. Harel and Y. Koren. A fast multi-scale method for drawing large graphs. J. Graph Algorithms and Applications, 6:179-202, 2002.
20. K. Hayashi, M. Inoue, T. Masuzawa, and H. Fujiwara. A layout adjustment problem for disjoint rectangles preserving orthogonal order. In Proc. 6th Intl. Symp. Graph Drawing (GD '98), volume 1547 of LNCS, pages 183-197. Springer, 1998.
21. Y. F. Hu. Drawings of the mathematics genealogy project graphs. http://www.research.att.com/yifanhu/GALLERY/MATHGENEALOGY.
22. Y. F. Hu. Efficient and high quality force-directed graph drawing. Mathematica Journal, 10:37-71, 2005.
23. Y. F. Hu and Y. Koren. Extending the spring-electrical model to overcome warping effects. In Proceedings of IEEE Pacific Visualization Symposium 2009(PacificVis '09), pages 129-136, 2009.
24. X. Huang and W. Lai. Force-transfer: A new approach to removing overlapping nodes in graph layout. In Proc. 25th Australian Computer Science Conference, pages 349-358, 2003.
25. J. W. Jaromczyk and G. T. Toussaint. Relative neighborhood graphs and their relatives. Proc. IEEE, 80:1502-1517, 1992.
26. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7-15, 1989.
27. G. Leach. Improving worst-case optimal Delaunay triangulation algorithms. In 4th Canadian Conference on Computational Geometry, pages 340-346, 1992.
28. W. Li, P. Eades, and N. Nikolov. Using spring algorithms to remove node overlapping. In Proc. Asia-Pacific Symp. on Information Visualisation, pages 131-140, 2005.
29. K. A. Lyons, H. Meijer, and D. Rappaport. Algorithms for cluster busting in anchored graph drawing. J. Graph Algorithms and Applications, 2(1), 1998.
30. K. Marriott, P. J. Stuckey, V. Tam, and W. He. Removing node overlapping in graph layout using constrained optimization. Constraints, 8(2):143-171, 2003.
31. K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout adjustment and the mental map. J. Vis. Lang. Comput., 6(2):183-210, 1995.
32. North Dakota State University Dept. of Math. The mathematics genealogy project. http://genealogy.math.ndsu.nodak.edu/.
33. J. R. Shewchuk. Engineering a 2D quality mesh generator and Delaunay triangulator. In Applied Computational Geometry: Towards Geometric Engineering, volume 1148 of LNCS, pages 203-222. Springer, 1996.
34. J. R. Shewchuk. Delaunay refinement algorithms for triangular mesh generation. Computational Geometry: Theory and Applications, 22:21-74, 2002.
35. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. Systems, Man and Cybernetics, SMC11(2):109-125, 1981.
36. C. Walshaw. A multilevel algorithm for force-directed graph drawing. J. Graph Algorithms and Applications, 7:253-285, 2003.
37. X. Wang and I. Miyamoto. Generating customized layouts. In GD '95: Proceedings of the Symposium on Graph Drawing, volume 1027 of LNCS, pages 504-515. Springer, 1995.