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
Spirality and Optimal Orthogonal Drawings
SIAM Journal on Computing
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Orthogonal Drawings of Plane Graphs without Bends
GD '01 Revised Papers from the 9th International Symposium 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
| Hi-index | 0.00 |
In an orthogonal drawing of a plane graph, any edge is drawn as a sequence of line segments, each having either a horizontal or a vertical direction. A bend is a point where an edge changes its direction. A drawing is called a bend-minimum orthogonal drawing if the number of bends is minimum among all orthogonal drawings. This paper presents a linear-time algorithm to find a bend-minimum orthogonal drawing of any given plane 3-graph, that is, a plane graph of maximum degree three.