×

zbMATH — the first resource for mathematics

An object-oriented design for graph visualization. (English) Zbl 0972.68736
Summary: Many applications, from everyday file system browsers to visual programming tools, require the display of network and graph structures. The Graph Visualization Framework (GVF) (available at http://www.cwi.nl/InfoVisu/GVF) is an architecture that supports the tasks common to most graph browsers and editors. This article gives a brief overview of the design of the GVF and focuses on the core classes that are used to represent and manipulate graphs. The design of the core classes is justified by the requirements for navigation and visualization.
MSC:
68U99 Computing methodologies and applications
68R10 Graph theory (including graph drawing) in computer science
68P05 Data structures
Software:
LEDA; GraphXML; GTL; GVF
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Henry TR Interactive graph layout: The exploration of large graphs PhD Thesis 1992 ftp://ftp.cs.arizona.edu/reports/1992/TR92-03.ps
[2] Herman, Tree visualisation and navigation clues for information visualisation, Computer Graphics Forum 17 (2) pp 153– (1998) · Zbl 05469773
[3] Herman I Marshall MS Melançon G Duke D Delest M Domenger J-P Skeletal images as visual cues in graph visualization Proceedings of the Data Visualization ’99, Proceedings of the Joint Eurographics and IEEE TCVG Symposium on Visualization 1999 13 22
[4] Herman, Graph visualization and navigation in information visualization: A survey, IEEE Transactions on Visualization and Computer Graphics 6 (1) pp 24– (2000) · Zbl 05108063
[5] Himsolt M http://infosun.fmi.uni-passau.de/Graphlet/GML/ 1997
[6] Herman I Marshall MS GraphXML-An XML-based graph description format Proceedings of the Symposium on Graph Drawing 2000 52 62
[7] http://www.w3.org/Graphics/SVG/ 2000
[8] Sarkar, Graphical fisheye views, Communications of the ACM 37 (12) pp 73– (1994)
[9] Horstmann, Core Java 2, Volume 2: Advanced Features; ch. 8 (2000)
[10] Upson, The application visualization system: A computational environment for scientific visualization, IEEE Computer Graphics and Applications pp 30– (1989) · Zbl 05086229
[11] Chi EH Barry P Riedl J Konstan J A spreadsheet approach to information visualization Proceedings of the IEEE Symposium on Information Visualization 1997 17 24
[12] Melançon G Dutour I Bousquet-Melou M Random generation of Dags for graph drawing Centre for Mathematics and Computer Sciences, Amsterdam INS-R0005 2000 ftp://ftp.cwi.nl/pub/CWIreports/INS/INS-R0005.pdf
[13] Marshall MS Herman I Melançon G Automatic generation of interactive overview diagrams for the navigation of large graphs Centre for Mathematics and Computer Sciences, Amsterdam INS-R0014 2000 http://www.cwi.nl/InfoVisu/papers/Hierarchical.pdf
[14] Wills, Niche Works-interactive visualization of very large graphs, Journal of Computational and Graphical Statistics 8 (2) pp 190– (1999)
[15] Huang ML Eades P A fully animated interactive system for clustering and navigating huge graphs Proceedings of the Symposium on Graph Drawing GD’98, Berlin 1998 374 383
[16] Munzner T Drawing large graphs with H3Viewer and site manager Proceedings of the Symposium on Graph Drawing GD’98, Berlin 1998 384 393
[17] Gamma, Design Patterns (1995)
[18] Arbab, An object model for multimedia programming, Computer Graphics Forum 12 (3) pp 101– (1993) · Zbl 05468136
[19] Pizzonia M Battista GD Object-oriented design of graph oriented data structures Proceedings of the 1st Workshop on Algorithm Engineering and Experiments (ALENEX ’99) 1999
[20] Duke, PREMO: A Framework for Multimedia Middleware: Specification, Rationale, and Java Binding (1998)
[21] Eckel, Thinking in Java (1998)
[22] Sosnoski DM http://www.javaworld.com/javaworld/jw-11-1999/jw-11-performance.html 1999
[23] Coad, Java Design: Building Better Apps and Applets (1997)
[24] Alpert, Recent developments in netlist partitioning: A survey, Integration: The VLSI Journal 19 (1-2) pp 1– (1995) · Zbl 0876.94063
[25] Herman I Marshall MS Melançon G Density functions for visual attributes and effective partitioning in graph visualization Proceedings IEEE Symposium on Information Visualization 2000 49 56
[26] Wilson RM Bergeron RD Dynamic hierarchy specification and visualization Proceedings IEEE Symposium on Information Visualization (InfoVis ’99) 1999 65 72
[27] Brandes U Shubina G Tamassia R Improving angular resolution in visualizations of geographic networks Proceedings of the Second Joint Eurographics and IEEE TCVG Symposium on Visualization 2000 23 33
[28] He T Internet-based front-end to network simulator Proceedings of the Joint EUROGRAPHICS and IEEE TCVG Symposium on Visualization (Data Visualization ’99) 1999 247 252
[29] http://www.tomsawyer.com/get/paper-java.html 1999
[30] http://www.ilog.com/products/jviews/graphlayout/
[31] Gansner, An open graph visualization system and its applications to software engineering, Software-Practice and Experience 30 (11) pp 1203– (2000) · Zbl 1147.68782
[32] Paulisch, EDGE: An extendible graph editor, Software-Practice and Experience 20 (S1) pp 63– (1990)
[33] Mutzel P Gutwengwer C Brockenauer R Fialko S Klau G Kruger M Ziegler T Naher S Alberts D Ambras D Koch G Junger M Bucheim C Leipert S A library of algorithms for graph drawing Proceedings of the Symposium on Graph Drawing GD’98 1998 456 457
[34] http://www.dia.uniroma3.it/gdt/ 1999
[35] Mehlhorn, LEDA: A Platform for Combinatorial and Geometric Computing (1999)
[36] http://www.mpi-sb.mpg.de/LEDA/ 1999
[37] Berry J Dean N Goldberg M Shannon G Skiena S Graph drawing and manipulation with LINK Proceedings of the Symposium on Graph Drawing GD’97 1997 425 437
[38] Cesar CL http://www.alphaWorks.ibm.com/tech/gfc 1999
[39] Forster M Pick A Raitner M http://infosun.fmi.uni-passau.de/GTL/ 1999
[40] Himsolt, Graphlet: design and implementation of a graph editor, Software-Practice and Experience 30 (11) pp 1303– (2000) · Zbl 1147.68784
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.