On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Area requirement and symmetry display of planar upward drawings
Discrete & Computational Geometry
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
Computing Orthogonal Drawings with the Minimum Number of Bends
IEEE Transactions on Computers
Experimental studies on graph drawing algorithms
Software—Practice & Experience - Special issue on discrete algorithm engineering
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Algorithms and Area Bounds for Nonplanar Orthogonal Drawings
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
On the Orthogonal Drawing of Outerplanar Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Algorithmica
Algorithms for computing a parameterized st-orientation
Theoretical Computer Science
DAGView: an approach for visualizing large graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
Orthogonal drawings are widely used for graph visualization due to their high clarity of representation. In this paper we present a technique called Overloaded Orthogonal Drawing. We first place the vertices on grid points following a relaxed version of dominance drawing, called weak dominance condition. Edge routing is implied automatically by the vertex coordinates. In order to simplify these drawings we use an overloading technique. All algorithms are simple and easy to implement and can be applied to directed acyclic graphs, planar, non-planar and also undirected graphs. We also present bounds on the number of bends and the area. Overloaded Orthogonal drawings present several interesting properties such as efficient visual edge confirmation as well as simplicity and clarity of the drawing.