Academia.eduAcademia.edu

Outline

Title
Abstract
Figures
Introduction
Related Work
Graph Data Model
Data Transformations
Case Studies
Dynamic Call Graph Analysis
Social Network Analysis
Conclusion
References
All Topics
Computer Science
Computer Graphics

Rapid Serial Visual Presentation in dynamic graph visualization

Profile image of Fabian BeckFabian Beck

2012, 2012 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)

Abstract

Rapid Serial Visual Presentation is an effective approach for browsing and searching large amounts of data. By presenting subsequent images at high frequency, we utilize the perceptual abilities of the human visual system to rapidly process certain visual features. While this concept is successfully used in video and image browsing, we demonstrate how it can be applied to dynamic graph visualization. In this paper, we introduce a visualization technique for time-varying graphs that is scalable with respect to the number of time steps. The graph visualization is based on the Parallel Edge Splatting technique, which employs a space-efficient display of a sequence of dynamically changing graphs. To illustrate the usefulness of our approach we analyzed method call graphs recorded during the execution of the open source software system JHotDraw. Furthermore, we studied a time-varying social network representing researchers and their dynamic communication structure while attending the ACM Hypertext 2009 conference.

Figures (6)
Fig. 1. A graph is transformed to a bipartite graph by copying the vertex set V4 to V4, and only allow edges between V4 and V4. Each vertex group is mapped equidistantly on one axis of two parallel vertical axes and edges as straight links between the axes.
Fig. 1. A graph is transformed to a bipartite graph by copying the vertex set V4 to V4, and only allow edges between V4 and V4. Each vertex group is mapped equidistantly on one axis of two parallel vertical axes and edges as straight links between the axes.
Fig. 3. The concept of RSVP is applied by showing a subsequence of a dynamic graph at a time, using the idea of a sliding time window.
Fig. 3. The concept of RSVP is applied by showing a subsequence of a dynamic graph at a time, using the idea of a sliding time window.
Fig. 4. Outliers (a-d) and recurring patterns (e-h) on the level of interactions in the dynamic method call graph of JHotDraw.
Fig. 4. Outliers (a-d) and recurring patterns (e-h) on the level of interactions in the dynamic method call graph of JHotDraw.
Fig. 5. | Method calls in the main thread of JHotDraw; (a) single calls; (b) aggregated calls.
Fig. 5. | Method calls in the main thread of JHotDraw; (a) single calls; (b) aggregated calls.
Fig. 6. Face-to-face contacts of the ACM Hypertext 2009 conference attendees (green bars: sessions).
Fig. 6. Face-to-face contacts of the ACM Hypertext 2009 conference attendees (green bars: sessions).

Related papers

Methods for Software Visualization of Large Graph Data Structures
Radoslava Kraleva

International Journal on Advanced Science, Engineering and Information Technology

In this paper, three different methods for software visualization of large graph structures, respectively Rectangle, Intersection and Combined are presented. The basic concepts for using software development environments are outlined. Their capabilities for visual designing and event-oriented programming are discussed. A brief analysis of the basic features of the environment used to develop the ClipRect Monitor application is made. The main functions of this software are also presented. All experimental results in this study are generated with this application. According to the methodology, six graphs are prepared to determine the effectiveness of the three methods. The number of vertices and the edges of these graphs are proportional to the size of the drawing area (canvas). The drawing areas are also six and have different sizes, such that each subsequent area has a height and width twice the size of the previous one. Besides, for all areas, the width/height ratio is exactly 16:9. This ratio is widely used in monitors as well as laptops, mobile phones and tablets. The largest drawing area that the ClipRect Monitor application scanned during the experiments is 128 000 x 72 000 pixels. This scan is performed for graph G_6 with 1 415 vertices and 100 000 edges. The visualization area is diagonally positioned relative to the drawing area. For each visualization area, each of the three methods, respectively Rectangle, Intersection and Combined is performed. The Combined method executes the Rectangle method first and then the Intersection method. The results show that the Intersection method was the slowest compared to the other two methods in terms of the number of edges of the graph that are analyzed. When the visualization area is internal to the drawing area, the Rectangle method performs better than the Combined method. The Rectangle method gives the best result in terms of time for analysis and drawing of the edges of the graph. The Combined method combines the characteristics of the other two methods. This method is optimal in terms of the time of analysis of the need to draw the edges of the graph relative to the number of drawn edges.

View PDFchevron_right
Visual Exploration of Complex Time-Varying Graphs
gautam kumar

IEEE Transactions on Visualization and Computer Graphics, 2006

Many graph drawing and visualization algorithms, such as force-directed layout and line-dot rendering, work very well on relatively small and sparse graphs. However, they often produce extremely tangled results and exhibit impractical running times for highly non-planar graphs with large edge density. And very few graph layout algorithms support dynamic time-varying graphs; applying them independently to each frame produces distracting temporally incoherent visualizations. We have developed a new visualization technique based on a novel approach to hierarchically structuring dense graphs via stratification. Using this structure, we formulate a hierarchical force-directed layout algorithm that is both efficient and produces quality graph layouts. The stratification of the graph also allows us to present views of the data that abstract away many small details of its structure. Rather than displaying all edges and nodes at once, resulting in a convoluted rendering, we present an interactive tool that filters edges and nodes using the graph hierarchy and allows users to drill down into the graph for details. Our layout algorithm also accommodates time-varying graphs in a natural way, producing a temporally coherent animation that can be used to analyze and extract trends from dynamic graph data. For example, we demonstrate the use of our method to explore financial correlation data for the U.S. stock market in the period from 1990 to 2005. The user can easily analyze the time-varying correlation graph of the market, uncovering information such as market sector trends, representative stocks for portfolio construction, and the interrelationship of stocks over time.

View PDFchevron_right
Interactive information visualization in a conference location
Chiara Caschera
View PDFchevron_right
A Framework for Visualising Large Graphs
Seok-hee Hong

Ninth International Conference on Information Visualisation (IV'05), 2005

Visualising large graphs faces the challenges of both data complexity and visual complexity. This paper presents a framework for visualising large graphs that reduces data complexity using the clustered graph model and provides users with navigational approaches for browsing clustered graphs. A key design task of such a system is to define a strategy for generating logical abstractions of a clustered graph during navigation. An appropriate abstraction strategy should represent a clustered graph well and avoid visual overload. The semantic fisheye view of a clustered graph is proposed for such a purpose. Two case studies were investigated, and the experiment results show that during navigation the first-order fisheye view of a clustered graph conserves visual complexity at a constant level.

View PDFchevron_right
CGV—An interactive graph visualization system
James Abello

2009

Previous work on graph visualization has yielded a wealth of efficient graph analysis algorithms and expressive visual mappings. To support the visual exploration of graph structures, a high degree of interactivity is required as well.

View PDFchevron_right
Online Dynamic Graph Drawing
Ayellet Tal

IEEE Transactions on Visualization and Computer Graphics, 2000

This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and, thus, the user's mental map while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and handle large dynamic graphs. Techniques for representing graphs on the GPU allow a speedup by a factor of up to 17 compared to the CPU implementation. The scalability of the algorithm across GPU generations is demonstrated. Applications of the algorithm to the visualization of discussion threads in Internet sites and to the visualization of social networks are provided.

View PDFchevron_right
Visualization and analysis of large graphs
Bernard Dousset

Proceedings of the ACM first Ph. …, 2007

In Knowledge engineering, synthesized information has often an evolving and relational form. Information representation using graphs may ease data interpretation for non-expert users. However this graph may be complex and simplifications are useful in order to ease analysis. In this article, we present VisuGraph, a powerful tool for graph drawing. This tool gives the possibility to reduce large graph by two techniques: the Markov CLustering algorithm (MCL) application and the global graph division in time-sliced visualizations in order to specify and to simplify temporal analysis.

View PDFchevron_right
Dynamic Visualization of Temporal Communication Structures
Peter Gloor

ABSTRACT This paper describes a method to visualize the evolution of social communication structures over time. Our system analyzes the dynamic evolution of e-mail traffic within a group of individuals. The same visualization algorithm can be applied to any temporal communication network. The goal of our work is to develop a framework of visual temporal communication patterns of different types of collaborative knowledge networks.

View PDFchevron_right
Graph Visualization and Navigation in Information Visualization:A Survey
Herman Ti

IEEE Transactions on Visualization and Computer Graphics, 2000

This is a survey on graph visualization and navigation techniques, as used in information visualization. Graphs appear in numerous applications such as web browsing, state-transition diagrams, and data structures. The ability to visualize and to navigate in these potentially large, abstract graphs is often a crucial part of an application. Information visualization has specific requirements, which means that this survey approaches the results of traditional graph drawing from a different perspective.

View PDFchevron_right
TGD: Visual Data Exploration of Temporal Graph Data (Proceedings Paper)
Michael Farrugia

2009

View PDFchevron_right

References (37)

  1. F. Beck and M. Burch and S. Diehl, Towards an Aesthetic Dimensions Framework for Dynamic Graph Visualizations, In Proc. of the Interna- tional Conference on Information Visualisation, pages 592-597, 2009.
  2. C. Bennett and J. Ryall and L. Spalteholz and A. Gooch, The Aesthetics of Graph Visualization, In Proc. of Computational Aesthetics, pages 57- 64, 2007.
  3. O. Bruijn and R. Spence, Rapid Serial Visual Presentation: A Space- Time Tradeoff in Information Presentation, In Proc. of Advanced Visual Interfaces, pages 189-192, 2000.
  4. O. Bruijn and R. Spence, Rapid Serial Visual Presentation, http://www.iis.ee.ic.ac.uk/ o.debruijn/rsvp.pdf, 2000.
  5. M. Burch and S. Diehl, TimeRadarTrees: Visualizing Dynamic Com- pound Digraphs, Computer Graphics Forum, 27(3), pages 823-830, 2008.
  6. M. Burch and M. Höferlin and D. Weiskopf, Layered TimeRadarTrees, In Proc. of International Conference on Information Visualization (IV), pages 18-25, 2011.
  7. M. Burch and C. Vehlow and F. Beck and S. Diehl and D. Weiskopf, Parallel Edge Splatting for Scalable Dynamic Graph Visualization, IEEE Trans. on Visualization and Computer Graphics, 17(12), pages 2344-2353, 2011.
  8. V. Coltheart, Fleeting Memories: Cognition of Brief Visual Stimuli (Cognitive Psychology), The MIT Press, 1999.
  9. D. Defays, An Efficient Algorithm for a Complete Link Method, The Computer Journal (British Computer Society), 20(4), pages 364-366, 1977.
  10. S. Diehl and C. Görg, Graphs, They Are Changing, In Proc. of International Symposium on Graph Drawing, pages 23-30, 2002.
  11. E. Eddie and G. Davenport, Video Streamer, In Conference Companion on Human Factors in Computing Systems, pages 65-68, 1994.
  12. B. Everitt and S. Landau and M. Leese, Cluster Analysis, Hodder Arnold Publications, 2001.
  13. Y. Frishman and A. Tal, Online Dynamic Graph Drawing, IEEE Trans. on Visualization and Computer Graphics, 14(4), pages 727-740, 2008.
  14. T.M.J. Fruchterman and E.M. Reingold, Graph Drawing by Force- Directed Placement, Software: Practice and Experience, 21(11), pages 1129-1164, 1991.
  15. M. R. Garey and David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, 1979.
  16. M. Ghoniem and J. D. Fekete and P. Castagliola, A Comparison of the Readability of Graphs Using Node-Link and Matrix-Based Representa- tions, In Proc. of IEEE Symposium on Information Visualization, pages 17-24, 2004.
  17. M. Greilich and M. Burch and S. Diehl, Visualizing the Evolution of Compound Digraphs with TimeArcTrees, Computer Graphics Forum, 28(3), pages 975-982, 2009.
  18. J. Heinrich and D. Weiskopf, Continuous Parallel Coordinates, IEEE Trans. on Visualization and Computer Graphics, 15(6), 1531-1538, 2009.
  19. J. Heinrich and S. Bachthaler and D. Weiskopf, Progressive Splatting of Continuous Scatterplots and Parallel Coordinates, Computer Graphics Forum, 30(3), 653-662, 2011.
  20. D. Holten, Hierarchical Edge Bundles: Visualization of Adjacency Re- lations in Hierarchical Data, IEEE Trans. on Visualization and Computer Graphics, 12(5), 741-748, 2006.
  21. A. Inselberg and B. Dimsdale, Parallel Coordinates: A Tool for Visu- alizing Multi-Dimensional Geometry, In Proc. of the IEEE Visualization Conference, pages 361-378, 1990.
  22. L. Isella and J. Stehle and A. Barrat and C. Cattuto and J.-F. Pinton and W. van den Broeck, What's in a Crowd? Analysis of Face-to-Face Behavioral Networks, Journal of Theoretical Biology, 271(166), 2011.
  23. L. Kaufman and P.J. Rousseeuw, Finding Groups in Data: An Introduc- tion to Cluster Analysis, John Wiley & Sons, Inc., 1990.
  24. J. Kruskal and J. Landwehr, Icicle Plots: Better Displays for Hierarchical Clustering, The American Statistician, 37, 162-168, 1983.
  25. K. Lam and R. Spence, Image Browsing: A Space-Time Trade-Off, Human-Computer Interaction, pages 611-612, 1997.
  26. R. van Liere and W.C. de Leeuw, GraphSplatting: Visualizing Graphs as Continuous Fields, IEEE Trans. on Visualization and Computer Graphics, 9(2), 206-212, 2003.
  27. C.B. Mills and L.J. Weldon, Reading Text from Computer Screens, ACM Computer Surveys, 19(4), pages 329-357, 1987.
  28. K. Misue and P. Eades and W. Lai and K. Sugiyama, Layout Adjustment and the Mental Map, Journal of Visual Languages and Computing, 6(2), pages 183-210, 1995.
  29. H. C. Purchase, Metrics for Graph Drawing Aesthetics, Journal of Visual Languages and Computing, 13(5), pages 501-516, 2002.
  30. F. Reitz and M. Pohl and S. Diehl, Focused Animation of Dynamic Com- pound Graphs, In Proc. of the International Symposium on Information Visualisation, pages 679-684, 2009.
  31. R. Rosenholtz and Y. Li and J. Mansfield and Z. Jin, Feature Congestion: A Measure of Display Clutter, In Proc. of SIGCHI Conference on Human Factors in Computing Systems, pages 761-770, 2005.
  32. R. Sibson, SLINK: An Optimally Efficient Algorithm for the Single- Link Cluster Method, The Computer Journal (British Computer Society), 16(1), pages 30-34, 1973.
  33. R. Spence, Rapid, Serial and Visual: A Presentation Technique with Potential, Information Visualization, 1(1), pages 13-19, 2002.
  34. A. Telea and O. Ersoy, Image-Based Edge Bundles: Simplified Visual- ization of Large Graphs, Computer Graphics Forum, 29(3), pages 843- 852, 2010.
  35. T. Tse and G. Marchionini and W. Ding and L. Slaughter and A. Komlodi, Dynamic Key Frame Presentation Techniques for Augmenting Video Browsing, In Proc. of the Working Conference on Advanced Visual Interfaces, pages 185-194, 1998.
  36. B. Tversky and J. Bauer Morrison and M. Bétrancourt, Animation: Can it Facilitate?, International Journal on Human-Computer Studies, 57(4), 247-262, 2002.
  37. K. Wittenburg and W. Ali-Ahmed and D. LaLiberte and T. Lanning, Rapid-Fire Image Previews for Information Navigation, In Proc. of Advanced Visual Interfaces, pages 76-82, 1998.

Related papers

The state of the art in visualizing dynamic graphs
Stephan Diehl

Figure 1: Illustrated hierarchical taxonomy of dynamic graph visualization techniques; the number of published techniques per taxonomic category is encoded in the brightness of the background (for details see Table 4).

View PDFchevron_right
A Taxonomy and Survey of Dynamic Graph Visualization
Stephan Diehl

Computer Graphics Forum, 2016

Dynamic graph visualization focuses on the challenge of representing the evolution of relationships between entities in readable, scalable and effective diagrams. This work surveys the growing number of approaches in this discipline. We derive a hierarchical taxonomy of techniques by systematically categorizing and tagging publications. While static graph visualizations are often divided into node-link and matrix representations, we identify the representation of time as the major distinguishing feature for dynamic graph visualizations: either graphs are represented as animated diagrams or as static charts based on a timeline. Evaluations of animated approaches focus on dynamic stability for preserving the viewer's mental map or, in general, compare animated diagrams to timeline-based ones. A bibliographic analysis provides insights into the organization and development of the field and its community. Finally, we identify and discuss challenges for future research. We also provide feedback from experts, collected with a questionnaire, which gives a broad perspective of these challenges and the current state of the field.

View PDFchevron_right
Real-time Graph Visualization with JavaFX: Exploring Large-scale Network Structures
Aditya Chandel

Indian Scientific Journal Of Research In Engineering And Management, 2024

The ability to visualize and comprehend complex network structures is crucial in various domains, including social media analysis, computer networks, and transportation systems. However, visualizing large-scale graphs poses significant challenges due to computational limitations and rendering performance constraints. This research paper presents a novel approach to real-time graph visualization using JavaFX, a powerful Java-based framework for developing rich client applications. By leveraging efficient data structures, rendering optimizations, and multithreading techniques, our proposed system achieves real-time visualization of large-scale graphs, enabling users to explore and interact with dynamic network structures seamlessly. The system incorporates advanced layout algorithms and visual encodings to enhance the clarity and interpretability of the visualizations. Extensive experiments were conducted using real-world and synthetic datasets to evaluate the system's performance, scalability, and usability. The results demonstrate the effectiveness of our approach in rendering large graphs in real-time, outperforming existing techniques. Furthermore, a user study was conducted to assess the system's usability and gather feedback on interaction and exploration features, highlighting potential applications in various domains.

View PDFchevron_right
GMine: interactive browsing of large graphs
Jose F Rodrigues-Jr

IV Workshop on Information Visualization and Analysis in Social Networks - Brazilian Symposium on Databases, 2008

Graphs are abstract representations that can describe a large set of real world phenomena and that, possibly, scale to the order of hundreds of thousands of nodes and millions of edges. Benefiting from such graphs can be better performed by means of visual interaction. However, in the domain of large graphs, excessive processing and limited display space bound the possibilities for visual presentation and processing. In this line, we introduce GMine, a prototype system that uses an innovative data structure, the Graph-Tree. The engineering of GMine allows for scalability over huge graphs stored on disk, an extended graph representation embracing both hierarchical and plain organization, and the interactive browsing of graph hierarchies.

View PDFchevron_right
graphVizdb: A Scalable Platform for Interactive Large Graph Visualization
Nikos Bikakis

We present a novel platform for the interactive visualization of very large graphs. The platform enables the user to interact with the visualized graph in a way that is very similar to the exploration of maps at multiple levels. Our approach involves an offline preprocessing phase that builds the layout of the graph by assigning coordinates to its nodes with respect to a Euclidean plane. The respective points are indexed with a spatial data structure, i.e., an R-tree, and stored in a database. Multiple abstraction layers of the graph based on various criteria are also created offline, and they are indexed similarly so that the user can explore the dataset at different levels of granularity, depending on her particular needs. Then, our system translates user operations into simple and very efficient spatial operations (i.e., window queries) in the backend. This technique allows for a fine-grained access to very large graphs with extremely low latency and memory requirements and without compromising the functionality of the tool. Our web-based prototype supports three main operations: (1) interactive navigation, (2) multi-level exploration, and (3) keyword search on the graph metadata.

View PDFchevron_right

Related topics

  • Computer Science
  • Visualization
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved