Controllable and Progressive Edge Clustering for Large Networks
Node-link diagrams are widely used in information visualization to show relationships among data. However, when the size of data becomes very large, node-link diagrams will become cluttered and visually confusing for users. In this paper, we propose a novel controllable edge clustering method based on Delaunay triangulation to reduce visual clutter for node-link diagrams. Our method uses curves instead of straight lines to represent links and these curves can be grouped together according to their relative positions and directions. We further introduce progressive edge clustering to achieve continuous level-of-details for large networks.
- 1.Carpendale, M., Rong, X.: Examining edge congestion. In: CHI ’01 extended abstracts on Human factors in computing systems, pp. 115–116 (2001), doi:10.1145/634067.634137Google Scholar
- 2.Wong, N., Carpendale, M., Greenberg, S.: Edgelens: An interactive method for managing edge congestion in graphs. In: IEEE Symposium on Information Visualization 2003, pp. 51–58 (2003)Google Scholar
- 3.van Ham, F., van Wijk, J.J.: Interactive visualization of small world graphs, pp. 199–206 (2004)Google Scholar
- 7.Wong, N., Carpendale, S.: Interactive poster: Using edge plucking for interactive graph exploration. Poster in the IEEE Symposium on Information Visualization (2005)Google Scholar
- 8.Hoppe, H.: Progressive meshes. In: Proceedings of ACM SIGGRAPH ’96, pp. 99–108. ACM, New York (1996)Google Scholar