Visualizing Large Graphs with Compound-Fisheye Views and Treemaps

Abello, James and Kobourov, Stephen G. and Yusufov, Roman (2004) Visualizing Large Graphs with Compound-Fisheye Views and Treemaps. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 431-441 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_44).

Full text not available from this repository.

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.

Item Type:Conference Paper
Additional Information:10.1007/978-3-540-31843-9_44
Classifications:M Methods > M.300 Dynamic / Incremental / Online
P Styles > P.240 Compound
ID Code:614

Repository Staff Only: item control page

References

J. Abello, I. Finocchi, and J. Korn. Graph sketches. In IEEE Proc. Information Visualization, pages 67-71, 2001.

J. Abello and J. Korn. Mgv: A system to visualize massive multi-digraphs. IEEE Transactions on Computer Graphics and Visualization, pages 1-16, 2002.

B. Bederson, B. Shneiderman, and M. Wattenberg. Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies. ACM Transactions on Graphics, 21(4):833-854, 2002.

U. Brandes, M. Gaertler, and D. Wagner. Experiments on graph clustering algorithms. In 11th Euro. Symp. on Algorithms (ESA) , pages 568-579, 2003.

M. Bruls, K. Huizing, and J. J. van Wijk. Squarified treemaps. In Proc. Joint Eurographics/IEEE TVCG Symp. Visualization, VisSymp, pages 33-42, 2000.

A. L. Buchsbaum, M. T. Goodrich, and J. R. Westbrook. Range searching over tree cross products. In 8th Euro. Symp. on Algorithms (ESA), pages 120-131, 2000.

A. L. Buchsbaum and J. R. Westbrook. Maintaining hierarchical graph views. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 566-575, 2000.

C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Balanced aspect ratio trees and their use for drawing large graphs. Journal of Graph Algorithms and Applications, 4:19-46, 2000.

P. Eades and Q. Feng. Multilevel visualization of clustered graphs. In Proceedings of the 4th Symposium on Graph Drawing (GD), pages 101-112, 1996.

P. Eades and Q. Feng, and X. Lin. Straight-line drawing algorithms for hierarchical graphs and clustered graphs . In Proceedings of the 4th Symposium on Graph Drawing (GD), pages 113-128, 1996.

G. W. Furnas. Generalized fisheye views. In Proceedings of ACM Conference on Human Factors in Computing Systems (CHI '86), pages 16-23, 1986.

P. Gajer and S. G. Kobourov. GRIP: Graph dRawing with Intelligent Placement. Journal of Graph Algorithms and Applications, 6(3):203-224, 2002.

R. Hadany and D. Harel. A multi-scale algorithms for drawing graphs nicely. Discrete Applied Mathematics, 113(1):3-21, 2001.

D. Harel and Y. Koren. A fast multi-scale method for drawing large graphs. Journal of graph algorithms and applications, 6:179-202, 2002.

R. Sablowski and A. Frick. Automatic graph clustering. In Proceedings of the 4th Symposium on Graph Drawing (GD), pages 395-400, 1996.

M. Sarkar and M. H. Brown. Graphical fisheye views. Communications of the ACM 37(12):73-84, 1994.

B. Shneiderman. Tree visualization with treemaps: a 2-d space-filling approach. Technical report, HCI Lab, University of Maryland, Mar. 1991.

K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Manb and Cybernetics, 21(4):876-892, 1991.

S. van Dongen. Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht, 2000.

C. Walshaw. A multilevel algorithm for force-directed graph drawing. In Proceedings of the 8th Symposium on Graph Drawing (GD), pages 171-182, 2000.