Visualizing large graphs with compound-fisheye views and treemaps

Lecture Notes in Computer Science

Volumn 3383, Issue , 2004, Pages 431-441

  Abello, James ^a   Kobourov, Stephen G ^b   Yusufov, Roman ^b  

^a Center for Discrete Mathematics and Theoretical Computer Science   (United States)

^b University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPOUND-FISHEYE VIEWS; HIER-ARCHICAL CLUSTERING; TREEMAPS; CLUSTER TREE; FISHEYE VIEWS; LARGE GRAPHS; TREE-MAPS; TREEMAP;

COMPUTER SCIENCE; DRAWING (GRAPHICS); MAPPING; TREES (MATHEMATICS);

GRAPH THEORY; TREES (MATHEMATICS);

EID: 24144448986     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. J. Abello, I. Finocchi, and J. Korn. Graph sketches. In IEEE Proc. Information Visualization, pages 67-71, 2001.
2. J. Abello and J. Korn. Mgv: A system to visualize massive multi-digraphs. IEEE Transactions on Computer Graphics and Visualization, pages 1-16, 2002.
3. 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.
4. U. Brandes, M. Gaertler, and D. Wagner. Experiments on graph clustering algorithms. In 11th Euro. Symp. on Algorithms (ESA), pages 568-579, 2003.
5. M. Bruls, K. Huizing, and J. J. van Wijk. Squarified treemaps. In Proc. Joint Eurographics/IEEE TVCG Symp. Visualization, VisSym, pages 33-42, 2000.
6. 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.
7. 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.
8. 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.
9. P. Eades and Q. Feng. Multilevel visualization of clustered graphs. In Proceedings of the 4th Symposium on Graph Drawing (GD), pages 101-112, 1996.
10. P. Eades, 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.
11. G. W. Furnas. Generalized fisheye views. In Proceedings of ACM Conference on Human Factors in Computing Systems (CHI '86), pages 16-23, 1986.
12. P. Gajer and S. G. Kobourov. GRIP: Graph dRawing with Intelligent Placement. Journal of Graph Algorithms and Applications, 6(3):203-224, 2002.
13. R. Hadany and D. Harel. A multi-scale algorithm for drawing graphs nicely. Discrete Applied Mathematics, 113(1):3-21, 2001.
14. D. Harel and Y. Koren. A fast multi-scale method for drawing large graphs. Journal of graph algorithms and applications, 6:179-202, 2002.
15. R. Sablowski and A. Frick. Automatic graph clustering. In Proceedings of the 4th Symposium on Graph Drawing (GD), pages 395-400, 1996.
16. M. Sarkar and M. H. Brown. Graphical fisheye views. Communications of the ACM, 37(12):73-84, 1994.
17. B. Shneiderman. Tree visualization with treemaps: a 2-d space-filling approach. Technical report, HCI Lab, University of Maryland, Mar. 1991.
18. K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Man, and Cybernetics, 21(4):876-892, 1991.
19. S. van Dongen. Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht, 2000.
20. C. Walshaw. A multilevel algorithm for force-directed graph drawing. In Proceedings of the 8th Symposium on Graph Drawing (GD), pages 171-182, 2000.