Geometry-based edge clustering for graph visualization

IEEE Transactions on Visualization and Computer Graphics

Volumn 14, Issue 6, 2008, Pages 1277-1284

  Cui, Weiwei ^a   Zhou, Hong ^a   Qu, Huamin ^a   Wong, Pak Chung ^b   Li, Xiaoming ^c  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b PACIFIC NORTHWEST NATIONAL LABORATORY   (United States)

^c PEKING UNIVERSITY   (China)

Author keywords

Edge clustering; Graph visualization; Mesh; Visual clutter

Indexed keywords

CLUSTERING; CLUSTERING METHODS; CLUSTERING PROCESSES; CONTROL MESHES; CONTROL POINTS; EDGE BUNDLES; EDGE CLUSTERING; EDGE CROSSINGS; EFFICIENT; FLEXIBLE; GRAPH VISUALIZATION; GRAPH VISUALIZATIONS; LARGE GRAPHS; LEVELS OF DETAILS; MESH; MODEL RELATIONSHIPS; UNDERLYING GRAPHS; VISUAL CLUTTER; VISUALIZATION TECHNIQUES;

CLUSTERING ALGORITHMS; FLOW OF SOLIDS; GRAPHIC METHODS; MATHEMATICAL MODELS; VISUALIZATION;

GRAPH THEORY;

EID: 54949133661     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2008.135     Document Type: Conference Paper

References (23)

1. D. Archambault, T. Munzner, and D. Auber. TopoLayout: Multilevel graph layout by topological features. IEEE Transactions on Visualization and Computer Graphics, 13(2):305-317, 2007.
2. G. D. Battista. P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing; Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
3. L. P. Chew. Constrained Delaunay triangulations. In Proceed. of the Symposium on Computational Geometry, pages 215-222, 1987.
4. R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics (TOG), 15(4):301-331, 1996.
5. M. Dickerson, D, Eppstein, M. T. Goodrich, and J. Y. Meng. Confluent drawings: Visualizing non-planar diagrams in a planar way. J. Graph Algorithms Appl., 9(1):31-52. 2005.
6. R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. Wiley, 1973.
7. G. Ellis and A. Dix. A taxonomy of clutter reduction for information visualisation. IEEE Transactions on Visualization and Computer Graphics, 13(6):1216-1223, 2007.
8. A. Frick, A. Ludwig, and H. Mehldau. A Fast Adaptive Layout Algorithm for Undirected Graphs. Proceedings of the DIMACS International Workshop on Graph Drawing, pages 388-403, 1994.
9. Y. Frishman and A. Tal. Multi-level graph layout on the GPU. IEEE Transactions on Visualization and Computer Graphics, 13(6): 1310-1319, 2007.
10. E. Gansner, Y. Koren, and S. North. Topological fisheye views for visualizing large graphs. In Proc. of the IEEE Symp. on information Visualization, pages 175-182, 2004.
11. E. R. Gansner and Y. Koren. Improved circular layouts. In Proceed. of Symposium on Graph Drawing, pages 386-398, 2006,
12. D. Holten. Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Transactions on Visualization and Computer Graphics, 12(5):741-748, 2006.
13. P. Hui, M. Pelsmajer, M. Schaefer, and D. Stefankovic. Train Tracks and Confluent Drawings. Proceed, of Symposium on Graph Drawing, pages 465-479, 2004.
14. J. Johansson, P. Ljung, M. Jern, and M. Cooper. Revealing structure within clustered parallel coordinates displays. In Proc. of IEEE Symp. on Information Visualization, pages 125-132, 2005.
15. M. Kaufmann and D. Wagner. Drawing Graphs: Methods and Models. Springer, 2001.
16. Y. Koren, L. Carmel, and D. Harel. Drawing huge graphs by algebraic multigrid optimization. SIAM Multiscale Modeling and Simulation. 1(4):645-673, 2003.
17. A. Noack. An energy model for visual graph clustering. In Proceed. of Symposium on Graph Drawings, Pages 425-436, 2003.
18. D. Phan, L. Xiao, R. Yeh, P. Hanrahan, and T. Winograd. Flow map layout. IEEE Symposium on Information Visualization 2005. pages 219-224, 2005.
19. H. Qu, H. Zhou, and Y, Wu. Controllable and progressive edge clustering for large networks. In Proceed. of Symposium on Graph Drawing, pages 399-404, 2006.
20. F. van Ham and J. J. van Wijk. Interactive visualization of small world graphs. IEEE Symposium on Information Visualization 2004, pages 199-206, 2004.
21. N. Wong, M. Carpendale, and S. Greenberg. Edgelens: An interactive method for managing edge congestion in graphs. IEEE Symposium on Information Visualization 2003, pages 51-58, 2003,
22. N. Wong and S. Carpendale. Interactive poster: Using edge plucking for interactive graph exploration. Poster in the IEEE Symposium on Information Visualization. 2005.
23. P- C. Wong, H, Foote, G. C. Jr., P. Mackey, and K. Perrine. Graph signatures for visual analytics. IEEE Transactions on Visualization and Computer Graphics, 12(6): 1399-1413, 2006.