Results 1  10
of
10
Using Graph Layout to Visualize Train Interconnection Data
, 2000
"... We are concerned with the problem of visualizing interconnections in railroad systems. The realworld systems we have to deal with contain connections of thousands of trains. To visualize such a system from a given set of time tables a socalled train graph is used. It contains a vertex for each ..."
Abstract

Cited by 27 (5 self)
 Add to MetaCart
We are concerned with the problem of visualizing interconnections in railroad systems. The realworld systems we have to deal with contain connections of thousands of trains. To visualize such a system from a given set of time tables a socalled train graph is used. It contains a vertex for each station met by any train, and one edge between every pair of vertices connected by some train running from one station to the other without halting in between.
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 26 (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.
Visualising a Fund Manager Flow Graph with Columns and Worms
 Proceedings of the 6th International Conference on Information Visualisation (IV ’02
, 2002
"... This paper describes a paradigm for visualising time dependant flow in a network of objects connected by abstract relationships (a graph) by representing time in the third dimension. We show two variants of the paradigm, one in which the elements of the graph are shown as vertical columns of varying ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
(Show Context)
This paper describes a paradigm for visualising time dependant flow in a network of objects connected by abstract relationships (a graph) by representing time in the third dimension. We show two variants of the paradigm, one in which the elements of the graph are shown as vertical columns of varying width and another which emphasises centrality with bending "worms". We demonstrate these techniques by visualising the movements of Fund Managers within the UK Stock Market in terms of their changing share ownership over time.
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.
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.
Fully Dynamic Orthogonal Graph Layout for Interactive Systems
, 2000
"... We combine and supplement existing approaches to arrive at a general algorithm for dynamic orthogonal graph drawing with few bends. Our approach is applicable to nonplanar graphs with vertices of arbitrary degree, reduces the number of bends if possible, allows explicit control of the bendnumber/ ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We combine and supplement existing approaches to arrive at a general algorithm for dynamic orthogonal graph drawing with few bends. Our approach is applicable to nonplanar graphs with vertices of arbitrary degree, reduces the number of bends if possible, allows explicit control of the bendnumber/modification tradeoff and does not suffer from the socalled rotation problem, all of which have been limitations in earlier approaches.
Open Archive TOULOUSE Archive Ouverte (OATAO)
"... OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. This is an authordeposited version published in: ..."
Abstract
 Add to MetaCart
(Show Context)
OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. This is an authordeposited version published in:
unknown title
"... This paper describes a paradigm for visualising time dependant relationships (a graph) by representing time in the third dimension. We show two variants of the paradigm, one in which the elements of the graph are shown as vertical columns of varying width and another which emphasises centrality with ..."
Abstract
 Add to MetaCart
(Show Context)
This paper describes a paradigm for visualising time dependant relationships (a graph) by representing time in the third dimension. We show two variants of the paradigm, one in which the elements of the graph are shown as vertical columns of varying width and another which emphasises centrality with bending “worms”. We demonstrate these techniques by visualising the movements of Fund Managers within the UK Stock Market in terms of their changing share ownership over time. 1
Dynamic WWW Structures in 3D
"... 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. ..."
Abstract
 Add to MetaCart
(Show Context)
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