## Graph Drawing in Motion (2002)

### Cached

### Download Links

- [www.math.ethz.ch]
- [www.emis.math.ca]
- [www.emis.de]
- [www.cs.brown.edu]
- [www.maths.tcd.ie]
- [www.emis.de]
- [emis.maths.tcd.ie]
- [www.maths.tcd.ie]
- DBLP

### Other Repositories/Bibliography

Venue: | Journal of Graph Algorithms and Applications |

Citations: | 28 - 0 self |

### BibTeX

@ARTICLE{Friedrich02graphdrawing,

author = {Carsten Friedrich and Peter Eades},

title = {Graph Drawing in Motion},

journal = {Journal of Graph Algorithms and Applications},

year = {2002},

volume = {6},

pages = {2002}

}

### Years of Citing Articles

### OpenURL

### Abstract

Enabling the user of a graph drawing system to preserve the mental map between two di#erent layouts of a graph is a major problem. In this paper we present methods that smoothly transform one drawing of a graph into another without any restrictions to the class of graphs or type of layout algorithm.

### Citations

1086 |
Robust regression and outlier detection
- Rousseeuw, Leroy
- 1987
(Show Context)
Citation Context ... the transformation The sum of the Euclidean squares is known to be statistically biased and to over-emphasize outlying samples. Other distance functions are much harder to minimize on the other hand =-=[8, 13]-=-. To increase statistic stability different approaches are imaginable. The median or centroid of the drawings could be added to the node set with a weight factor. Another promising approach would be t... |

585 |
Robust Statistics. The Approach Based on Influence Functions
- Hampel, Ronchetti, et al.
- 1986
(Show Context)
Citation Context ... the transformation The sum of the Euclidean squares is known to be statistically biased and to over-emphasize outlying samples. Other distance functions are much harder to minimize on the other hand =-=[8, 13]-=-. To increase statistic stability different approaches are imaginable. The median or centroid of the drawings could be added to the node set with a weight factor. Another promising approach would be t... |

329 |
Graph Drawing: Algorithms for the Visualization of Graphs
- Battista, Eades, et al.
- 1999
(Show Context)
Citation Context ... static but change their structure and layout according to user and application actions. Preserving the mental map during these changes has been identified to be crucial for the usability of a system =-=[2]-=-. There are two possible approaches to this problem: either develop graph drawing algorithms that try to minimize changes [3], or to communicate the changes in the form of an animation [7, 9, 10], tha... |

101 | A fast adaptive layout algorithm for undirected graphs
- Frick, Ludwig, et al.
- 1995
(Show Context)
Citation Context ...criteria for a good animation is enforced. However more sophisticated approaches are more appropriate in some cases. We have developed an adaptation of the force directed layout approach described in =-=[6]-=- to move the nodes to their final positions. The repulsive forces are similar to the static version, whereas instead of attracting edges, nodes are attracted to their destination. This approach provid... |

93 |
Ecological constraints on internal representation: Resonant kinematics of perceiving, imagining, thinking, and dreaming. psvcholoaic~ Review
- Shepard
- 1984
(Show Context)
Citation Context ...objects in the image by the human brain. A detailed analysis of perceptional mechanisms is beyond the scope of this paper. For an introduction to human perception of moving pictures see, for example, =-=[1, 5, 15]-=-. In the case of a graph animation, the frames are drawings of graphs. The changes in the drawings are changes in the positions of the nodes and edges. The animation should help the user to maintain t... |

52 | T.: Matrix animation and polar decomposition
- SHOEMAKE, DUFF
- 1992
(Show Context)
Citation Context ... interpolating the entries from to tm will produce the matrix � � 1 0 0 1 � � 0 0 0 0 at some stage collapsing the graph to one point. This does not happen in a 180 degree rotation. Shoemake a=-=nd Duff [16]-=- show that the rotation part of the transformation is the only part not compatible with linear entry interpolation and propose polar matrix decomposition as an efficient way to separate the rotational... |

23 |
Geometry symmetry in graphs
- Manning
- 1990
(Show Context)
Citation Context ...ure of a graph. In an animation symmetry of movement makes it easier to understand the structure of the movement. A formal measure for symmetric node movement can be derived by extending the model in =-=[11]. -=-• Maximize movement interpreted as movement of a rigid object The human is very good at interpreting two dimensional projections of movements of three dimensional rigid objects in IR 3 . We should t... |

22 |
A force-directed algorithm that preserves edge crossing properties
- Bertault
- 1999
(Show Context)
Citation Context ...se changes has been identified to be crucial for the usability of a system [2]. There are two possible approaches to this problem: either develop graph drawing algorithms that try to minimize changes =-=[3]-=-, or to communicate the changes in the form of an animation [7, 9, 10], that is, a smooth transition from the old drawing to the new drawing. While specialized algorithms work quite well in practice, ... |

20 |
Psychologically simple motions as geodesic paths. I. Asymmetric objects
- Carlton, Shepard
- 1990
(Show Context)
Citation Context ...objects in the image by the human brain. A detailed analysis of perceptional mechanisms is beyond the scope of this paper. For an introduction to human perception of moving pictures see, for example, =-=[1, 5, 15]-=-. In the case of a graph animation, the frames are drawings of graphs. The changes in the drawings are changes in the positions of the nodes and edges. The animation should help the user to maintain t... |

8 |
Finding the Best Viewpoint for Three-Dimensional Graph Drawings
- Webber
- 1998
(Show Context)
Citation Context ...vement. 2.1.4 Display of non-existing structures should be avoided. An often neglected problem in graph drawing is the case where the drawing suggests some structure which does not exist in the graph =-=[17]-=-. Figure 2 shows an example for two layouts of the same graph, where the second layout could lead the user wrongly to assume that the graph is a simple path. Similar problems can occur easily during a... |

7 | Mechanisms for motion perception
- Adelson
- 1991
(Show Context)
Citation Context ...objects in the image by the human brain. A detailed analysis of perceptional mechanisms is beyond the scope of this paper. For an introduction to human perception of moving pictures see, for example, =-=[1, 5, 15]-=-. In the case of a graph animation, the frames are drawings of graphs. The changes in the drawings are changes in the positions of the nodes and edges. The animation should help the user to maintain t... |

7 | Rapid assembly and deployment of domain visualisation solutions - Pattison, Vernik, et al. - 2001 |

6 | The ffgraph library
- Friedrich
- 1995
(Show Context)
Citation Context ...of a system [2]. There are two possible approaches to this problem: either develop graph drawing algorithms that try to minimize changes [3], or to communicate the changes in the form of an animation =-=[7, 9, 10]-=-, that is, a smooth transition from the old drawing to the new drawing. While specialized algorithms work quite well in practice, general animation techniques tend to fail to actually improve usabilit... |

1 |
Graph-drawing contest report
- Brandenburg, Jünger, et al.
- 1999
(Show Context)
Citation Context ...ayout. Examples of structural changes in graphs are collapsing or expanding sub graphs in clustered graphs, navigation in infinite graphs 2 or graphs such as graph A of the 1999 Graph Drawing Contest =-=[4]-=- which represents the changes in the cast of a soap opera. 2.1 Criteria for a good animation We try to achieve the following goals with animation between two graph layouts. 1. Preserve the mental map ... |

1 |
The AGD-Library User Manual Version 1.1.2. Max-Planck-Institut für Informatik
- deAGD
(Show Context)
Citation Context ...of a system [2]. There are two possible approaches to this problem: either develop graph drawing algorithms that try to minimize changes [3], or to communicate the changes in the form of an animation =-=[7, 9, 10]-=-, that is, a smooth transition from the old drawing to the new drawing. While specialized algorithms work quite well in practice, general animation techniques tend to fail to actually improve usabilit... |

1 |
Navigating clustered graphs using forcedierected methods
- Huang, Eades
(Show Context)
Citation Context ...of a system [2]. There are two possible approaches to this problem: either develop graph drawing algorithms that try to minimize changes [3], or to communicate the changes in the form of an animation =-=[7, 9, 10]-=-, that is, a smooth transition from the old drawing to the new drawing. While specialized algorithms work quite well in practice, general animation techniques tend to fail to actually improve usabilit... |