Results 1 - 10
of
26
Visual Unrolling of Network Evolution and the Analysis of Dynamic Discourse
, 2002
"... A new method for visualizing the class of incrementally evolving networks is presented. In addition to the intermediate states of the network it conveys the nature of the change between them by unrolling the dynamics of the network. Each modification is shown in a separate layer of a three-dimension ..."
Abstract
-
Cited by 35 (6 self)
- Add to MetaCart
A new method for visualizing the class of incrementally evolving networks is presented. In addition to the intermediate states of the network it conveys the nature of the change between them by unrolling the dynamics of the network. Each modification is shown in a separate layer of a three-dimensional representation, where the stack of layers corresponds to a time line of the evolution. We focus on discourse networks as the driving application, but our method extends to any type of network evolving in similar ways.
Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections
, 2001
"... We propose a novel visualization approach that facilitates graphical exploration and communication of relative actor status in social networks. The main idea is to map, in a drawing of the entire network, actor status scores to vertical coordinates. The resulting problem of determining horizonta ..."
Abstract
-
Cited by 17 (5 self)
- Add to MetaCart
We propose a novel visualization approach that facilitates graphical exploration and communication of relative actor status in social networks. The main idea is to map, in a drawing of the entire network, actor status scores to vertical coordinates. The resulting problem of determining horizontal positions of actors and routing of connecting lines such that the overall layout is readable is algorithmically difficult, yet well-studied in the literature on graph drawing. We outline a customized approach. The advantages
Radial Level Planarity Testing and Embedding in Linear Time
- Journal of Graph Algorithms and Applications
, 2005
"... A graph with a given partition of the vertices on k concentric circles is radial level planar if there is a vertex permutation such that the edges can be routed strictly outwards without crossings. Radial level planarity extends level planarity, where the vertices are placed on k horizontal lines an ..."
Abstract
-
Cited by 17 (9 self)
- Add to MetaCart
A graph with a given partition of the vertices on k concentric circles is radial level planar if there is a vertex permutation such that the edges can be routed strictly outwards without crossings. Radial level planarity extends level planarity, where the vertices are placed on k horizontal lines and the edges are routed strictly downwards without crossings. The extension is characterised by rings, which are level non-planar biconnected components. Our main results are linear time algorithms for radial level planarity testing and for computing an embedding. We introduce PQR-trees as a new data structure where R-nodes and associated templates for their manipulation are introduced to deal with rings. Our algorithms extend level planarity testing and embedding algorithms which use PQ-trees.
A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information
, 2007
"... In radial drawings of hierarchical graphs the vertices are placed on concentric circles rather than on horizontal lines and the edges are drawn as outwards monotone segments of spirals rather than straight lines as it is both done in the standard Sugiyama framework. This drawing style is well suite ..."
Abstract
-
Cited by 16 (7 self)
- Add to MetaCart
In radial drawings of hierarchical graphs the vertices are placed on concentric circles rather than on horizontal lines and the edges are drawn as outwards monotone segments of spirals rather than straight lines as it is both done in the standard Sugiyama framework. This drawing style is well suited for the visualisation of centrality in social networks and similar concepts. Radial drawings also allow a more flexible edge routing than horizontal drawings, as edges can be routed around the center in two directions. In experimental results this reduces the number of crossings by approximately 30 percent on average. Few crossings are one of the major criteria for human readability. This paper is a detailed description of a complete framework for visualizing hierarchical information in a new radial fashion. Particularly, we briefly cover extensions of the level assignment step to benefit by the increasing perimeters of the circles, present three heuristics for crossing reduction in radial level drawings, and also show how to visualize the results.
Characterization of unlabeled level planar trees
- 14TH SYMPOSIUM ON GRAPH DRAWING (GD), VOLUME 4372 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2006
"... Consider a graph G drawn in the plane so that each vertex lies on a distinct horizontal line ℓj = {(x, j) | x ∈ R}. The bijection φ that maps the set of n vertices V to a set of distinct horizontal lines ℓj forms a labeling of the vertices. Such a graph G with the labeling φ is called an n-level gr ..."
Abstract
-
Cited by 12 (7 self)
- Add to MetaCart
Consider a graph G drawn in the plane so that each vertex lies on a distinct horizontal line ℓj = {(x, j) | x ∈ R}. The bijection φ that maps the set of n vertices V to a set of distinct horizontal lines ℓj forms a labeling of the vertices. Such a graph G with the labeling φ is called an n-level graph and is said to be n-level planar if it can be drawn with straight-line edges and no crossings while keeping each vertex on its own level. In this paper, we consider the class of trees that are n-level planar regardless of their labeling. We call such trees unlabeled level planar (ULP). Our contributions are three-fold. First, we provide a complete characterization of ULP trees in terms of a pair of forbidden subtrees. Second, we show how to draw ULP trees in linear time. Third, we provide a linear time recognition algorithm for ULP trees.
Layout effects on sociogram perception
- Proceedings of 13th International Symposium on Graph Drawing (GD’05
, 2005
"... Abstract. This paper describes a within-subjects experiment in which we compare the relative effectiveness of five sociogram drawing conventions in communicating underlying network substance, based on user task performance and usability preference, in order to examine effects of different spatial la ..."
Abstract
-
Cited by 8 (5 self)
- Add to MetaCart
Abstract. This paper describes a within-subjects experiment in which we compare the relative effectiveness of five sociogram drawing conventions in communicating underlying network substance, based on user task performance and usability preference, in order to examine effects of different spatial layout formats on human sociogram perception. We also explore the impact of edge crossings, a widely accepted readability aesthetic. Subjective data were gathered based on the methodology of Purchase et al. [14]. Objective data were collected through an online system. We found that both edge crossings and conventions pose significant effects on user preference and task performance of finding groups, but either has little impact on the perception of actor status. On the other hand, the node positioning and angular resolution might be more important in perceiving actor status. In visualizing social networks, it is important to note that the techniques that are highly preferred by users do not necessarily lead to best task performance. 1
Social Network Analysis with sna
"... Modern social network analysis—the analysis of relational data arising from social systems—is a computationally intensive area of research. Here, we provide an overview of a software package which provides support for a range of network analytic functionality within the R statistical computing envir ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
Modern social network analysis—the analysis of relational data arising from social systems—is a computationally intensive area of research. Here, we provide an overview of a software package which provides support for a range of network analytic functionality within the R statistical computing environment. General categories of currently supported functionality are described, and brief examples of package syntax and usage are shown.
Radial coordinate assignment for level graphs
- Proc. Computing and Combinatorics, COCOON 2005, volume 3595 of LNCS
, 2005
"... Abstract. We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing the vertex ordering, and therefore without introducing new edge crossings. Edges are drawn as sequences of sp ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
Abstract. We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing the vertex ordering, and therefore without introducing new edge crossings. Edges are drawn as sequences of spiral segments with at most two bends. 1
An Eye Tracking Study into the Effects of Graph Layout
, 2009
"... Graphs are typically visualized as node-link diagrams. Although there is a fair amount of research focusing on crossing minimization to improve readability, little attention has been paid on how to handle crossings when they are an essential part of the final visualizations. This requires us to unde ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
Graphs are typically visualized as node-link diagrams. Although there is a fair amount of research focusing on crossing minimization to improve readability, little attention has been paid on how to handle crossings when they are an essential part of the final visualizations. This requires us to understand how people read graphs and how crossings affect reading performance. As an initial step to this end, a preliminary eye tracking experiment was conducted. The specific purpose of this experiment was to test the effects of crossing angles and geometric-path tendency on eye movements and performance. Sixteen subjects performed both path search and node locating tasks with six drawings. The results showed that small angles can slow down and trigger extra eye movements, causing delays for path search tasks, whereas crossings have little impact on node locating tasks. Geometric-path tendency indicates that a path between two nodes can become harder to follow when many branches of the path go toward the target node. The insights obtained are discussed with a view to further confirmation in future work.

