Results 1  10
of
19
SketchDriven Orthogonal Graph Drawing
, 2002
"... We present an orthogonal graph drawing algorithm that uses a sketchy drawing of the graph as input. While the algorithm produces an orthogonal drawing with few bends in the Kandinsky model it also preserves the general appearance of the sketch. Potential applications for this kind of drawing alg ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
We present an orthogonal graph drawing algorithm that uses a sketchy drawing of the graph as input. While the algorithm produces an orthogonal drawing with few bends in the Kandinsky model it also preserves the general appearance of the sketch. Potential applications for this kind of drawing algorithm include the generation of schematic maps from geographic networks and interactive orthogonal graph drawing.
Graphs, they are changing  dynamic graph drawing for a sequence of graphs
 Proc. 10th Int. Symp. Graph Drawing (GD 2002), number 2528 in Lecture Notes in Computer Science, LNCS
, 2002
"... Abstract. In this paper we present a generic algorithm for drawing sequences of graphs. This algorithm works for different layout algorithms and related metrics and adjustment strategies. It differs from previous work on dynamic graph drawing in that it considers all graphs in the sequence (offline) ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Abstract. In this paper we present a generic algorithm for drawing sequences of graphs. This algorithm works for different layout algorithms and related metrics and adjustment strategies. It differs from previous work on dynamic graph drawing in that it considers all graphs in the sequence (offline) instead of just the previous ones (online) when computing the layout for each graph of the sequence. We introduce several general adjustment strategies and give examples of these strategies in the context of forcedirected graph layout. Finally some results from our first prototype implementation are discussed. 1
A user study in similarity measures for graph drawing
 Journal of Graph Algorithms and Applications
, 2002
"... The need for a similarity measure for comparing two drawings of graphs arises in problems such as interactive graph drawing and the indexing or browsing of large sets of graphs. Many applications have been based on intuitive ideas of what makes two drawings look similar — for example, the idea that ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
The need for a similarity measure for comparing two drawings of graphs arises in problems such as interactive graph drawing and the indexing or browsing of large sets of graphs. Many applications have been based on intuitive ideas of what makes two drawings look similar — for example, the idea that vertex positions should not change much. In this paper, we formally define several of these intuitive ideas of similarity and present the results of a user study designed to evaluate how well these measures reflect human perception of similarity.
Visualization of Graphs with Associated Timeseries Data
"... The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a visual property (e.g. color) of the vertex, along with sliders or some such mechanism to animate the graph for other timepo ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a visual property (e.g. color) of the vertex, along with sliders or some such mechanism to animate the graph for other timepoints. Alternatively, data from all the timepoints can be overlaid simultaneously by embedding small charts into graph vertices. These graph visualizations may also be linked to other visualizations (e.g., parallel coordinates) using brushing and linking. This paper describes a study performed to evaluate and rank graph+timeseries visualization options based on users’ performance time and accuracy of responses on predefined tasks. The results suggest that overlaying data on graph vertices one timepoint at a time may lead to more accurate performance for tasks involving analysis of a graph at a single timepoint, and comparisons between graph vertices for two distinct timepoints. Overlaying data simultaneously for all the timepoints on graph vertices may lead to more accurate and faster performance for tasks involving searching for outlier vertices displaying different behavior than the rest of the graph vertices for all timepoints. Single views have advantage over multiple views on tasks that require topological information. Also, the number of attributes displayed on nodes has a non trivial influence on accuracy of responses, whereas the number of visualizations affect the performance time.
Visualization of the high level structure of the internet with hermes
 in Computer Science at the Technische Universität München in 1998. In
, 2002
"... Hermes is a system for exploring and visualizing the Internet structure at the level of the Autonomous Systems and their interconnections. It relies on a threetier architecture, on a large repository of routing information coming from heterogeneous sources, and on sophisticated graph drawing engine ..."
Abstract

Cited by 9 (9 self)
 Add to MetaCart
Hermes is a system for exploring and visualizing the Internet structure at the level of the Autonomous Systems and their interconnections. It relies on a threetier architecture, on a large repository of routing information coming from heterogeneous sources, and on sophisticated graph drawing engine. Such an engine exploits static and dynamic graph drawing techniques, specifically devised for the visualization of large graphs with high density.
Dynamic WWW Structures in 3D
 JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS
, 2000
"... We describe a method for threedimensional straightline representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of the 1998 Graph Drawing Contest and constitutes a customized blend of techniques known from the Graph Drawing literatu ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We describe a method for threedimensional straightline representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of the 1998 Graph Drawing Contest and constitutes a customized blend of techniques known from the Graph Drawing literature. Since we feel that they may be of interest to others facing similar graph drawing problems, some technical details are mixed in. The animation of the contest graph and accompanying material are available from the Journal of Graph Algorithms and Applications's Web site.
A Quantitative Comparison of StressMinimization Approaches for Offline Dynamic Graph Drawing
, 2012
"... In dynamic graph drawing, the input is a sequence of graphs for which a sequence of layouts is to be generated such that the quality of individual layouts is balanced with layout stability over time. Qualitatively different extensions of drawing algorithms for static graphs to the dynamic case have ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
In dynamic graph drawing, the input is a sequence of graphs for which a sequence of layouts is to be generated such that the quality of individual layouts is balanced with layout stability over time. Qualitatively different extensions of drawing algorithms for static graphs to the dynamic case have been proposed, but little is known about their relative utility. We report on a quantitative study comparing the three prototypical extensions via their adaptation for the stressminimization framework. While some findings are more subtle, the linking approach connecting consecutive instances of the same vertex is found to be the overall method of choice.
Graph multidrawing: Finding nice drawings without defining nice
 the Proc. of Graph Drawing
, 1998
"... Abstract. This paper proposes a multidrawing approach to graph drawing. Current graphdrawing systems typically produce only one drawing of a graph. By contrast, the multidrawing approach calls for systematically producing many drawings of the same graph, where the drawings presented to the user rep ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Abstract. This paper proposes a multidrawing approach to graph drawing. Current graphdrawing systems typically produce only one drawing of a graph. By contrast, the multidrawing approach calls for systematically producing many drawings of the same graph, where the drawings presented to the user represent a balance between aesthetics and diversity. This addresses a fundamental problem in graph drawing, namely, how to avoid requiring the user to specify formally and precisely all the characteristics of a single “nice ” drawing. We present a proofofconcept implementation with which we produce diverse selections of symmetriclooking drawings for small graphs. 1
Visualization Methods for Longitudinal Social Networks and Actorbased Modeling
, 2011
"... As a consequence of the rising interest in longitudinal social networks and their analysis, there is also an increasing demand for tools to visualize them. We argue that similar adaptations of stateoftheart graphdrawing methods can be used to visualize longitudinal networks and the fit of actor ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
As a consequence of the rising interest in longitudinal social networks and their analysis, there is also an increasing demand for tools to visualize them. We argue that similar adaptations of stateoftheart graphdrawing methods can be used to visualize longitudinal networks and the fit of actorbased models, the most prominent approach for analyzing such networks. The proposed methods are illustrated on a longitudinal network of acquaintanceship among university freshmen.
Finding Things in Fisheyes: Memorability in Distorted Spaces
 in Conference on Graphics Interface GI’03
, 2003
"... Interactive fisheye views use distortion to show both local detail and global context in the same display space. Although fisheyes allow the presentation and inspection of large data sets, the distortion effects can cause problems for users. One such problem is memorability  the ability to find an ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Interactive fisheye views use distortion to show both local detail and global context in the same display space. Although fisheyes allow the presentation and inspection of large data sets, the distortion effects can cause problems for users. One such problem is memorability  the ability to find and go back to objects and features in the data. In this paper we investigate the issue of how people remember object locations in distorted spaces, using a SarkarBrown fisheye lens that drastically affects the space. We carried out two studies. The first gathered information about what memory strategies people choose at increasing levels of distortion, without presupposing any particular strategy. The second looked more closely at how two particular strategies (maintaining a mental map, and using landmarks in the data) affected memory performance. We found that as distortion increases, people do use different memory strategies and that at higher levels of distortion, landmarks become increasingly important as memory aids.