Energy-based hierarchical edge clustering of graphs

IEEE Pacific Visualisation Symposium 2008, PacificVis - Proceedings

Volumn , Issue , 2008, Pages 55-62

  Zhou, Hong ^a   Yuan, Xiaoru ^b   Cui, Weiwei ^a   Qu, Huamin ^a   Chen, Baoquan ^c  

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

^b PEKING UNIVERSITY   (China)

^c UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Delaunay triangulation; Edge clustering; Graph visualization; Hierarchies; Node link diagrams

Indexed keywords

ABSTRACTING; CHLORINE COMPOUNDS; CLUSTER ANALYSIS; CLUTTER (INFORMATION THEORY); FLOW OF SOLIDS; VISUALIZATION;

CHALLENGING TASK; CLUSTERING METHODS; COMPLEX GRAPHS; CONTROL POINTS; DATA NODES; DELAUNAY TRIANGULATION; EDGE CLUSTERING; GRAPH EDGES; GRAPH TOPOLOGY; GRAPH VISUALIZATION; HIERARCHIES; HIGH-LEVEL ABSTRACTIONS; NODE-LINK DIAGRAMS; OF GRAPHS; VISUAL CLUTTER; VISUALISATION;

GRAPH THEORY;

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

References (19)

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. E. A. Bier, M. C. Stone, K. Pier, W. Buxton, and T. D. DeRose. Tool-glass and magic lenses: the see-through interface. In Proceedings of the SIGGRAPH '93, pages 73-80, 1993.
3. M. Carpendale and X. Rong. Examining edge congestion. CHI '01 extended abstracts on Human Factors in Computing Systems, pages 115-116, 2001.
4. 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(l):31-52, 2005.
5. A. Formella and J. Keller. Generalized flsheye views of graphs. In Proceedings of the 3rd International Symposium on Graph Drawing, pages 242-253, 1995.
6. G. W. Furnas. Generalized flsheye views. In CHI '86: Proceedings of the SIGCHI conference on Human factors in computing systems, pages 16-23, 1986.
7. E. R. Gansner and Y. Koren. Improved circular layouts. In Proceedings of the 14th International Symposium on Graph Drawing, pages 386-398, 2006.
8. K. Hoff III, J. Keyser, M. Lin, D. Manocha, and T. Culver. Fast computation of generalized Voronoi diagrams using graphics hardware. ACM Transactions on Computer Graphics, 33:277-286, 1999.
9. D. Holten. Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Transactions on Visualization and Computer Graphics, 12(5):741-748, 2006.
10. Y. K. Leung and M. D. Apperley. A review and taxonomy of distortion-oriented presentation techniques. ACM Trans. Comput.-Hum. Interact., 1(2): 126-160, 1994.
11. X. Lin. On the computational complexity of edge concentration. Discrete Appl. Math., 101(1-3):197-205, 2000.
12. F. J. Newbery. Edge concentration: A method for clustering directed graphs. In Proceedings of the 2nd International Workshop on Software Configuration Management, pages 76-85, 1989.
13. A. Noack. An energy model for visual graph clustering. In Proceedings of the 11th International Symposium on Graph Drawingg, pages 425-436, 2003.
14. A. Noack. Energy-based clustering of graphs with nonuniform degrees. In Proceedings of the 13th International Symposium, on Graph Drawing, pages 309-320, 2005.
15. D. Phan, L. Xiao, R. Yen, P. Hanrahan, and T. Winograd. Flow map layout. IEEE Symposium on Information Visualization 2005, pages 219-224, 2005.
16. H. Qu, H. Zhou, and Y. Wu. Controllable and progressive edge clustering for large networks. In 14th International Symposium on Graph Drawing, pages 399-404, 2006.
17. C. Ware, H. C. Purchase, L. Colpoys, and M. McGill. Cognitive measurements of graph aesthetics. Information Visualization, 1(2):. 103-110, 2002.
18. N. Wong and M. Carpendale. Interactive poster: Using edge plucking for itneractive graph exploration. In Poster in the IEEE Symposium on Information Visualization. (2005), 2005.
19. 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.