Results 11  20
of
20
Interactively Visualizing Dynamic Social Networks with DySoN
, 2009
"... The dynamic social network visualizer “DySoN” (Dynamic Social Networks) aims at understanding patterns and structural changes in dynamic social networks that evolve over time via an interactive visualization approach. As an alternative and supplementation to the numerous other approaches to visualiz ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
The dynamic social network visualizer “DySoN” (Dynamic Social Networks) aims at understanding patterns and structural changes in dynamic social networks that evolve over time via an interactive visualization approach. As an alternative and supplementation to the numerous other approaches to visualization of social network data and as an attempt to overcome some of the drawbacks of these approaches, DySoN interactively visualizes streaming event data of social interactions by an interactive threedimensional model of interpolated NURBS ”tubes”, representing activity and social proximity within a given set of actors during a given time period by using three dimensions of temporal information mapping: spatial density (tube distance), tubecolor and tubediameter. We use a self assembled large collaboration network of Jazz musicians with a straightforward semantics for the computation of relation strengths for the evaluation of the approach. We also discuss applications of the concept for awareness services in mobile peer to peer social networks, which exhibit a vivid measurable social micro dynamics in time and space.
An Investigation of . . . Draw Cayley Graphs
, 2008
"... Graph visualisation is an important field in Computer Science. The visualisation of groups in the form of Cayley graphs has applications in the layout of interconnected networks and mathematics. By using theoretical results from group theory, we present two algorithms that take as input a Cayley gra ..."
Abstract
 Add to MetaCart
Graph visualisation is an important field in Computer Science. The visualisation of groups in the form of Cayley graphs has applications in the layout of interconnected networks and mathematics. By using theoretical results from group theory, we present two algorithms that take as input a Cayley graph (G,S) and draws it in a layout that highlights the symmetry of the group and is easily readable.
A Refinement Approach to Visualization *
"... In this paper we present the design for a visualization system appropriate for instantiation in a Software Development Environment(SDE). The design lets the user of the SDE declaratively specify the data to be viewed and its visual rendering, and from that the visualization system generates the visu ..."
Abstract
 Add to MetaCart
In this paper we present the design for a visualization system appropriate for instantiation in a Software Development Environment(SDE). The design lets the user of the SDE declaratively specify the data to be viewed and its visual rendering, and from that the visualization system generates the visualization. Motivating this work is the acute need for SDEs that can present dynamicallydefined visualizations from userdefined, declarative descriptions of the data and its rendering. Our approach is based on the observation that a data rendering is a representation of an abstract data type. This paper applies our previous and ongoing work on data refinement to visualization. We adopt that work to yield a practical, implementable architecture for a visualization system. We illustrate the design on a number of examples.
1A Refinement Approach to Visualization*
"... In this paper we present the design for a visualization system appropriate for instantiation in a Software Development Environment(SDE). The design lets the user of the SDE declaratively specify the data to be viewed and its visual rendering, and from that the visualization system generates the visu ..."
Abstract
 Add to MetaCart
In this paper we present the design for a visualization system appropriate for instantiation in a Software Development Environment(SDE). The design lets the user of the SDE declaratively specify the data to be viewed and its visual rendering, and from that the visualization system generates the visualization. Motivating this work is the acute need for SDEs that can present dynamicallydefined visualizations from userdefined, declarative descriptions of the data and its rendering. Our approach is based on the observation that a data rendering is a representation of an abstract data type. This paper applies our previous and ongoing work on data refinement to visualization. We adopt that work to yield a practical, implementable architecture for a visualization system. We illustrate the design on a number of examples.
An Investigation of Algorithms to Aesthetically Draw Cayley Graphs
, 2008
"... Graph visualisation is an important field in Computer Science. The visualisation of groups in the form of Cayley graphs has applications in the layout of interconnected networks and mathematics. By using theoretical results from group theory, we present two algorithms that take as input a Cayley gr ..."
Abstract
 Add to MetaCart
(Show Context)
Graph visualisation is an important field in Computer Science. The visualisation of groups in the form of Cayley graphs has applications in the layout of interconnected networks and mathematics. By using theoretical results from group theory, we present two algorithms that take as input a Cayley graph (G,S) and draws it in a layout that highlights the symmetry of the group and is easily readable. 1
A Low Complexity Recursive ForceDirected Tree Layout Algorithm Based on the LennardJones Potential
"... In this paper, a low complexity forcedirected tree layout algorithm based on the LennardJones potential is described. The recursive method lays out subtrees as small disks contained in their parent disk. Inside each disk, children disks are dynamically laid out using a new force directed simulati ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper, a low complexity forcedirected tree layout algorithm based on the LennardJones potential is described. The recursive method lays out subtrees as small disks contained in their parent disk. Inside each disk, children disks are dynamically laid out using a new force directed simulation. Unlike most other force directed layout methods which run in quadratic time for each simulation step, this algorithm runs in O m ¡ 1 n ¢ m time per each step for a tree with n nodes, depth m and all the nodes having uniform number of children. The layout uses space efficiently and reflects both global structure and local detail. The method supports runtime insertion and deletion. Both operations and the evolving process are rendered with smooth animation to preserve visual continuity. The method could be used to monitor in real time, visualize and analyze a wide variety of data which has a rooted tree structure, e.g. internet hosts could be laid out by domain name (DNS) hierarchies. This paper gives a description of the algorithm, a complexity analysis and an example of how the algorithm is implemented to visualize DNS tree.
SUMMARY
"... We present a modification of the springembedder model of Eades [Congressus Numerantiurn, 42, 149160, (1984)) for drawing undirected graphs with straight edges. Our heuristic strives for uniform edge lengths, and we develop it in analogy to forces in natural systems, for a simple, elegant, conceptu ..."
Abstract
 Add to MetaCart
We present a modification of the springembedder model of Eades [Congressus Numerantiurn, 42, 149160, (1984)) for drawing undirected graphs with straight edges. Our heuristic strives for uniform edge lengths, and we develop it in analogy to forces in natural systems, for a simple, elegant, conceptuallyintuitive, and efficient algorithm. KEY WORDS Graph drawing Forcedirected placement Multilevel techniques Simulated annealing THE GRAPHDRAWING PROBLEM A graph G = ( V, E) is a set V of vertices and a set E of edges, in which an edge joins a pair of vertices. ’ Normally, graphs are depicted with their vertices as points in a plane and their edges as line or curve segments connecting those points. There are different styles of representation, suited to different types of graphs or different purposes of presentation. We concentrate on the most general class of graphs: undirected graphs, drawn with straight edges. In this paper, we introduce an algorithm that attempts to produce aestheticallypleasing, twodimensional pictures of graphs by doing simplified simulations of physical systems. We are concerned with drawing undirected graphs according to some generally