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
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
SIAM Journal on Computing
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
Spirality and Optimal Orthogonal Drawings
SIAM Journal on Computing
Graph Algorithms
On the Computational Complexity of Upward and Rectilinear Planarity Testing
SIAM Journal on Computing
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
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
Refinement of Orthogonal Graph Drawings
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection
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
On the Computational Complexity of Upward and Rectilinear Planarity Testing
On the Computational Complexity of Upward and Rectilinear Planarity Testing
Software—Practice & Experience
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
Upward Embeddings and Orientations of Undirected Planar Graphs
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Bend Minimization in Orthogonal Drawings Using Integer Programming
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Visualization of the Autonomous Systems Interconnections with HERMES
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Some Applications of Orderly Spanning Trees in Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
A topology-shape-metrics approach for the automatic layout of UML class diagrams
Proceedings of the 2003 ACM symposium on Software visualization
Automatic layout of UML class diagrams in orthogonal style
Information Visualization - Special issue: Software visualization
Topological Morphing of Planar Graphs
Graph Drawing
A new approximation algorithm for bend minimization in the Kandinsky model
GD'06 Proceedings of the 14th international conference on Graph drawing
The SPQR-tree data structure in graph drawing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Testing planarity of partially embedded graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Topology-driven force-directed algorithms
GD'10 Proceedings of the 18th international conference on Graph drawing
Minimum depth graph embeddings and quality of the drawings: an experimental analysis
GD'05 Proceedings of the 13th international conference on Graph Drawing
WhatsOnWeb: using graph drawing to search the web
GD'05 Proceedings of the 13th international conference on Graph Drawing
Non-planar orthogonal drawings with fixed topology
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Computing upward planar drawings using switch-regularity heuristics
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Fast and lossless graph division method for layout decomposition using SPQR-tree
Proceedings of the International Conference on Computer-Aided Design
GD'11 Proceedings of the 19th international conference on Graph Drawing
Overloaded orthogonal drawings
GD'11 Proceedings of the 19th international conference on Graph Drawing
Topological morphing of planar graphs
Theoretical Computer Science
| Hi-index | 14.98 |
We describe a branch-and-bound algorithm for computing an orthogonal grid drawing with the minimum number of bends of a biconnected planar graph. Such an algorithm is based on an efficient enumeration schema of the embeddings of a planar graph and on several new methods for computing lower bounds of the number of bends. We experiment with such algorithm on a large test suite and compare the results with the state-of-the-art. The experiments show the feasibility of the approach and also its limitations. Further, the experiments show how minimizing the number of bends has positive effects on other quality measures of the effectiveness of the drawing. We also present a new method for dealing with vertices of degree larger than four.