Geometry of planar graphs with angles
SCG '86 Proceedings of the second annual symposium on Computational geometry
On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Automatic graph drawing and readability of diagrams
IEEE Transactions on Systems, Man and Cybernetics
Using constraints to achieve stability in automatic graph layout algorithms
CHI '90 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
A framework for dynamic graph drawing
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On the Angular Resolution of Planar Graphs
SIAM Journal on Discrete Mathematics
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
Angles of Planar Triangular Graphs
SIAM Journal on Discrete Mathematics
New Lower Bounds for Orthogonal Graph Drawings
GD '95 Proceedings of the Symposium on Graph Drawing
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
GD '95 Proceedings of the Symposium on Graph Drawing
Issues in Interactive Orthogonal Graph Drawing
GD '95 Proceedings of the Symposium on Graph Drawing
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
A Bayesian Paradigm for Dynamic Graph Layout
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Improved Algorithms and Bounds for Orthogonal Drawings
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
A Better Heuristic for Orthogonal Graph Drawings
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Area-Efficient Static and Incremental Graph Drawings
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
On the Compuational Complexity of Upward and Rectilinear Planarity Testing
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Visualization of the Autonomous Systems Interconnections with HERMES
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Sketch-Driven Orthogonal Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Minimum depth graph embeddings and quality of the drawings: an experimental analysis
GD'05 Proceedings of the 13th international conference on Graph Drawing
GD'11 Proceedings of the 19th international conference on Graph Drawing
| Hi-index | 0.00 |
In orthogonal graph drawing, edges are represented by sequences of horizontal and vertical straight line segments. For graphs of degree at most four, this can be achieved by embedding the graph in a grid. The number of bends displayed is an important criterion for layout quality. A well-known algorithm of Tamassia efficiently embeds a planar graph with fixed combinatorial embedding and vertex degree at most four in the grid such that the number of bends is minimum [23]. When given a dynamic graph, i.e. a graph that changes over time, one has to take into account not only the static criteria of layout quality, but also the effort users spent to regain familiarity with the layout. Therefore, consecutive layouts should compromize between quality and stability. We here extend Tamassia's layout model to dynamic graphs in a way that allows to specify the relative importance of the number of bends vs. the number of changes between consecutive layouts. We also show that optimal layouts in the dynamic model can be computed efficiently by means that are very similar to the static model, namely by solving a minimum cost flow problem in a suitably defined network.