Topological fisheye views for visualizing large graphs

Proceedings - IEEE Symposium on Information Visualization, INFO VIS

Volumn , Issue , 2004, Pages 175-182

  Gansner, Emden ^a   Koren, Yehuda ^a   North, Stephen ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Large graph visualization; Topological fisheye

Indexed keywords

DISTORTION METHOD; HIERARCHY ZOOMING; LARGE GRAPH VISUALIZATION; TOPOLOGICAL FISHEYE;

COMPUTATIONAL COMPLEXITY; FUNCTIONS; GRAPH THEORY; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; TOPOLOGY; VISUALIZATION;

INFORMATION ANALYSIS;

EID: 16244389314     PISSN: 1522404X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFVIS.2004.66     Document Type: Conference Paper

References (23)

1. D. Auber, Y. Chiricota, F. Jourdan and G. Melançon. Multiscale Visualization of Small World Networks. Proc. IEEE Symposium on Information Visualization, 75-81, 2003.
2. M. S. T. Carpendale, D. J. Cowperthwaite and F. D. Fraechia. Making Distortions Comprehensible. Visual Languages, 36-45, 1997.
3. W. Cheswick and H. Burch. Mapping the Internet. IEEE Computer 32:4, 97-98,102, April 1999.
4. M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf. Computational Geometry - Algorithms and Applications, Springer Verlag, 1997.
5. G. Di Battista, P. Eades, R. Tamassia and Ioannis G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, 1999.
6. G. W. Furnas and B. B. Bederson. Space-scale diagrams: Understanding multiscale interfaces. Proc. Human Factors in Computing Systems, ACM, 234-241, 1995.
7. R. Hadany and D. Harel. A Multi-Scale Method for Drawing Graphs Nicely. Discrete Applied Math. 113, 3-21, 2001.
8. D. Harel and Y. Koren Graph Drawing by High-Dimensional Embedding. Proc. 10th International Sympoisum on Graph Drawing, Springer-Verlag LNCS 2528, 207-219, 2002.
9. J. Huotari, K. Lyytinen and M. Niemel. Improving Graphical Information System Model Use With Elision and Connecting Lines. ACM Transactions on Computer-Human Interaction 11:1, 26-58, March 2004.
10. M. Jünger and P. Mutzel, eds. Graph Drawing Software, Springer-Verlag, 2004.
11. G. Karypis and V. Kumar. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM Journal on Scientific Computing 20, 359-392, 1998.
12. T. Kamada and S. Kawai. An Algorithm for Drawing General Undirected Graphs. Info. Processing Letters 31:1 7-15, 1989.
13. Y. Koren, L. Carmel and D. Harel. Drawing Huge Graphs by Algebraic Multigrid Optimization. Multiscale Modeling and Simulation 1:4, 645-673, SIAM 2003.
14. J. Lamping and R. Rao. The Hyperbolic Browser. A Focus+Context Technique for Visualizing Large Hierachies. Journal of Visual Languages and Computing 6:4, 1995.
15. A. Lingas. A Linear-Time Construction of the Relative Neighborhood Graph From the Delaunay Triangulation. Computational Geometry 4:4, 199-208, 1994.
16. K. Mehlhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing, Cambridge University Press, 1999.
17. T. Munzner. H3: Laying Out Large Directed Graphs in 3D Hyperbolic Space. Proc. IEEE Symposium on Information Visualization, 2-10, 1997.
18. G. Parker, G. Franck and C. Ware. Visualization of Large Nested Graphs in 3D: Navigation and Interaction. Journal of Visual Languages and Computing, 299-317, 1998.
19. J. Petit. www.lsi.upc.es/~jpetit/MinLA/Experiments
20. M. Sarkar and M. H. Brown. Graphical Fisheye Views of Graphs. Proc. Conference on Computer-Human Interaction Conference, ACM, 83-91, 1992.
21. J.R. Shewchuk. Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. First Workshop on Applied Computational Geometry, ACM, 124-133, 1996. Also, www.cs.cmu.edu/~quake/triangle.html
22. C. Walshaw. www.gre.ac.uk/~c.walshaw/partition
23. C. Walshaw. A Multilevel Algorithm for Force-Directed Graph Drawing. Journal of Graph Algorithms and Applications 7:3, 253-285, 2003.