A Layout algorithm for data flow diagrams
IEEE Transactions on Software Engineering
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
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
An experimental comparison of four graph drawing algorithms
Computational Geometry: Theory and Applications
Orthogonal graph drawing with constraints
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Turn-regularity and optimal area drawings of orthogonal representations
Computational Geometry: Theory and Applications
Optimizing over All Combinatorial Embeddings of a Planar Graph
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Optimal Compaction of Orthogonal Grid Drawings
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Computing Orthogonal Drawings with the Minimum Number of Bends
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
On the Complexity of Orthogonal Compaction
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization
GD '95 Proceedings of the Symposium on Graph Drawing
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms
GD '95 Proceedings of the Symposium on Graph Drawing
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
Algorithmic Patterns for Orthogonal Graph Drawing
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Graph Drawing Algorithm Engineering with AGD
Revised Lectures on Software Visualization, International Seminar
Algorithms and theory of computation handbook
Crossing minimization and layouts of directed hypergraphs with port constraints
GD'10 Proceedings of the 18th international conference on Graph drawing
| Hi-index | 0.00 |
We present an experimental study in which we compare the state-of-the-art methods for compacting orthogonal graph layouts. Given the shape of a planar orthogonal drawing, the task is to place the vertices and the bends on grid points so that the total area or the total edge length is minimised. We compare four constructive heuristics based on rectangular dissection and on turn-regularity, also in combination with two improvement heuristics based on longest paths and network flows, and an exact method which is able to compute provable optimal drawings of minimum total edge length. We provide a performance evaluation in terms of quality and running time. The test data consists of two test-suites already used in previous experimental research. In order to get hard instances, we randomly generated an additional set of planar graphs.