Interactive Orthogonal Graph Drawing
IEEE Transactions on Computers
An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Refinement of Orthogonal Graph Drawings
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Visualization of the Autonomous Systems Interconnections with HERMES
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
A system for graph-based visualization of the evolution of software
Proceedings of the 2003 ACM symposium on Software visualization
Linkless symmetric drawings of series parallel digraphs
Computational Geometry: Theory and Applications
Dynamic graph drawing of sequences of orthogonal and hierarchical graphs
GD'04 Proceedings of the 12th international conference on Graph Drawing
Small drawings of series-parallel graphs and other subclasses of planar graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Graph drawing in the cloud: privately visualizing relational data using small working storage
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.01 |
Drawing graphs is an important problem that combines elements of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows: We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. We present efficient dynamic drawing algorithms for trees and series-parallel digraphs. As further applications of the model, we give dynamic drawing algorithms for planar st-digraphs and planar graphs. Our algorithms adopt a variety of representations (e.g., straight line, polyline, visibility) and update the drawing in a smooth way.