## Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time
Garg, Ashim and Liotta, Giuseppe
(1999)
Full text not available from this repository. ## AbstractLet G be a degree-3 planar biconnected graph with n vertices. Let Opt(G) be the minimum number of bends in any orthogonal planar drawing of G. We show that G admits a planar orthogonal drawing D with at most Opt(G)+3 bends that can constructed in O(n^{2}) time. The fastest known algorithm for constructing a bend-minimum drawing of G has time-complexity O(n^{5} log n) and therefore, we present a significantly faster algorithm that constructs almost bend-optimal drawings.
Repository Staff Only: item control page References |