Computing Orthogonal Drawings with the Minimum Number of Bends
IEEE Transactions on Computers
A Simple Parallel Algorithm to Draw Cubic Graphs
IEEE Transactions on Parallel and Distributed Systems
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
Computing Orthogonal Drawings in a Variable Embedding Setting
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Compact Encodings of Planar Orthogonal Drawings
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Bend-Minimum Orthogonal Drawings of Plane 3-Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
On the two-dimensional orthogonal drawing of series-parallel graphs
Discrete Applied Mathematics
On embedding a graph in the grid with the maximum number of bends and other bad features
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
A hybrid genetic algorithm for automatic graph drawing based on the topology-shape-metric approach.
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Upward Spirality and Upward Planarity Testing
SIAM Journal on Discrete Mathematics
Orthogonal graph drawing with flexibility constraints
GD'10 Proceedings of the 18th international conference on Graph drawing
A multiobjective genetic algorithm for automatic orthogonal graph drawing
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Upward spirality and upward planarity testing
GD'05 Proceedings of the 13th international conference on Graph Drawing
No-bend orthogonal drawings of series-parallel graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Orthogonal drawings of series-parallel graphs with minimum bends
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A fuzzy genetic algorithm for automatic orthogonal graph drawing
Applied Soft Computing
On point-sets that support planar graphs
Computational Geometry: Theory and Applications
Morphing orthogonal planar graph drawings
ACM Transactions on Algorithms (TALG)
Optimal orthogonal graph drawing with convex bend costs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We deal with the problem of constructing the orthogonal drawing of a graph with the minimum number of bends along the edges. The problem has been recently shown to be NP-complete in the general case. In this paper we introduce and study the new concept of spirality, which is a measure of how an orthogonal drawing is "rolled up," and develop a theory on the interplay between spirality and number of bends of orthogonal drawings. We exploit this theory to present polynomial time algorithms for two significant classes of graphs: series-parallel graphs and 3-planar graphs. Series-parallel graphs arise in a variety of problems such as scheduling, electrical networks, data-flow analysis, database logic programs, and circuit layout. Also, they play a central role in planarity problems. Furthermore, drawings of 3-planar graphs are a classical field of investigation.