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
A faster compaction algorithm with automatic jog insertion
Proceedings of the fifth MIT conference on Advanced research in VLSI
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
An experimental comparison of three graph drawing algorithms (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
2-Visibility Drawings of Planar Graphs
GD '96 Proceedings of the 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
Algorithms and Area Bounds for Nonplanar Orthogonal Drawings
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
Relevance of graph-drawing algorithms to graph-based interfaces
AVI '00 Proceedings of the working conference on Advanced visual interfaces
Refinement of Three-Dimensional Orthogonal Graph Drawings
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
| Hi-index | 0.00 |
Orthogonal drawings of graphs are widely investigated in the literature and many algorithms have been presented to compute such drawings. Most of these algorithms lead to unpleasant drawings with many bends and a large area. We present methods how to improve the quality of given orthogonal drawings. Our algorithms try to simulate the thinking of a human spectator in order to achieve good results. We also give instructions how to implement the strategies in a way that a good runtime performance can be achieved.