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
Algorithms for area-efficient orthogonal drawings
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
A better heuristic for orthogonal graph drawings
Computational Geometry: Theory and Applications
Characterizing bar line-of-sight graphs
SCG '85 Proceedings of the first annual symposium on Computational geometry
Optimal Orthogonal Drawings of Triconnected Plane Graphs
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
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
Algorithms and Area Bounds for Nonplanar Orthogonal Drawings
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Area-Efficient Static and Incremental Graph Drawings
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Improved Orthogonal Drawings of 3-graphs
Proceedings of the 8th Canadian Conference on Computational Geometry
| Hi-index | 0.00 |
In this paper, we present a new heuristic for orthogonal graph drawings, which creates drawings by performing a depth-first search and placing the nodes in the order they are encountered. This DFS-heuristic works for graphs with arbitrarily high degrees, and particularly well for graphs with maximum degree 3. It yields drawings with at most one bend per edge, and a total number of m-n+1 bends for a graph with n nodes and m edges; this improves significantly on the best previous bound of m-2 bends.