Abstract
Compound-fisheye views are introduced as a method for the display and interaction with large graphs. The method relies on a hierarchical clustering of the graph, and a generalization of the traditional fisheye view, together with a treemap representation of the cluster tree.
This work is partially supported by the NSF under grant ACR-0222920 and by ITCDI under grant 003297.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abello, J., Finocchi, I., Korn, J.: Graph sketches. In: IEEE Proc. Information Visualization, pp. 67–71 (2001)
Abello, J., Korn, J.: Mgv: A system to visualize massive multi-digraphs. IEEE Transactions on Computer Graphics and Visualization, 1–16 (2002)
Bederson, B., Shneiderman, B., Wattenberg, M.: Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies. ACM Transactions on Graphics 21(4), 833–854 (2002)
Brandes, U., Gaertler, M., Wagner, D.: Experiments on graph clustering algorithms. In: 11th Euro. Symp. on Algorithms (ESA), pp. 568–579 (2003)
Bruls, M., Huizing, K., van Wijk, J.J.: Squarified treemaps. In: Proc. Joint Eurographics/IEEE TVCG Symp. Visualization, VisSym, pp. 33–42 (2000)
Buchsbaum, A.L., Goodrich, M.T., Westbrook, J.R.: Range searching over tree cross products. In: 8th Euro. Symp. on Algorithms (ESA), pp. 120–131 (2000)
Buchsbaum, A.L., Westbrook, J.R.: Maintaining hierarchical graph views. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 566–575 (2000)
Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Balanced aspect ratio trees and their use for drawing large graphs. Journal of Graph Algorithms and Applications 4, 19–46 (2000)
Eades, P., Feng, Q.: Multilevel visualization of clustered graphs. In: Proceedings of the 4th Symposium on Graph Drawing (GD), pp. 101–112 (1996)
Eades, P., Feng, Q., Lin, X.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In: Proceedings of the 4th Symposium on Graph Drawing (GD), pp. 113–128 (1996)
Furnas, G.W.: Generalized fisheye views. In: Proceedings of ACM Conference on Human Factors in Computing Systems (CHI 1986), pp. 16–23 (1986)
Gajer, P., Kobourov, S.G.: GRIP: Graph dRawing with Intelligent Placement. Journal of Graph Algorithms and Applications 6(3), 203–224 (2002)
Hadany, R., Harel, D.: A multi-scale algorithm for drawing graphs nicely. Discrete Applied Mathematics 113(1), 3–21 (2001)
Harel, D., Koren, Y.: A fast multi-scale method for drawing large graphs. Journal of graph algorithms and applications 6, 179–202 (2002)
Sablowski, R., Frick, A.: Automatic graph clustering. In: Proceedings of the 4th Symposium on Graph Drawing (GD), pp. 395–400 (1996)
Sarkar, M., Brown, M.H.: Graphical fisheye views. Communications of the ACM 37(12), 73–84 (1994)
Shneiderman, B.: Tree visualization with treemaps: a 2-d space-filling approach. Technical report, HCI Lab, University of Maryland (March 1991)
Sugiyama, K., Misue, K.: Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Man, and Cybernetics 21(4), 876–892 (1991)
van Dongen, S.: Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht (2000)
Walshaw, C.: A multilevel algorithm for force-directed graph drawing. In: Proceedings of the 8th Symposium on Graph Drawing (GD), pp. 171–182 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abello, J., Kobourov, S.G., Yusufov, R. (2005). Visualizing Large Graphs with Compound-Fisheye Views and Treemaps. In: Pach, J. (eds) Graph Drawing. GD 2004. Lecture Notes in Computer Science, vol 3383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31843-9_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-31843-9_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24528-5
Online ISBN: 978-3-540-31843-9
eBook Packages: Computer ScienceComputer Science (R0)