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 Framework for the Automated Drawing of Data Structure Diagrams
IEEE Transactions on Software Engineering
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
Drawing graphs on rectangular grids
Discrete Applied Mathematics
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs
SIAM Journal on Computing
Graph drawing and information visualization
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
An experimental comparison of four graph drawing algorithms
Computational Geometry: Theory and Applications
Algorithms for area-efficient orthogonal drawings
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Issues in Interactive Orthogonal Graph Drawing
GD '95 Proceedings of the Symposium on Graph Drawing
A Graph Drawing and Translation Service on the WWW
GD '96 Proceedings of the Symposium on Graph Drawing
Experimental and Theoretical Results in Interactive Orthogonal 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
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
Interactive Orthogonal Graph Drawing: Algorithms and Bounds
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
A Better Heuristic for Orthogonal Graph Drawings
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Information visualization: orthogonal drawings of graphs
Information visualization: orthogonal drawings of graphs
Drawing planar graphs using the lmc-ordering
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Computing Orthogonal Drawings with the Minimum Number of Bends
IEEE Transactions on Computers
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Refinement of Three-Dimensional Orthogonal Graph Drawings
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
| Hi-index | 0.00 |
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the readability of orthogonal drawings can be significantly improved with a postprocessing technique, called refinement, which improves aesthetic qualities of a drawing such as area, bends, crossings, and total edge length. Refinement is separate from layout and works by analyzing and then fine-tuning the existing drawing in an efficient manner. In this paper we define the problem and goals of orthogonal drawing refinement and introduce a methodology which efficiently refines any orthogonal graph drawing. We have implemented our technique in C++ and conducted preliminary experiments over a set of drawings from five well known orthogonal drawing systems. Experimental analysis shows our technique to produce an average 34% improvement in area, 22% in bends, 19% in crossings, and 34% in total edge length.