Results 1 
1 of
1
Drawing Planar Graphs Using the Canonical Ordering
 ALGORITHMICA
, 1996
"... We introduce a new method to optimize the required area, minimum angle and number of bends of planar drawings of graphs on a grid. The main tool is a new type of ordering on the vertices and faces of triconnected planar graphs. Using this method linear time and space algorithms can be designed for m ..."
Abstract

Cited by 67 (0 self)
 Add to MetaCart
We introduce a new method to optimize the required area, minimum angle and number of bends of planar drawings of graphs on a grid. The main tool is a new type of ordering on the vertices and faces of triconnected planar graphs. Using this method linear time and space algorithms can be designed for many graph drawing problems.  Every triconnected planar graph G can be drawn convexly with straight lines on an (2n \Gamma 4) \Theta (n \Gamma 2) grid, where n is the number of vertices.  Every triconnected planar graph with maximum degree four can be drawn orthogonally on an n \Theta n grid with at most d 3n 2 e + 4, and if n ? 6 then every edge has at most two bends.  Every 3planar graph G can be drawn with at most b n 2 c + 1 bends on an b n 2 c \Theta b n 2 c grid.  Every triconnected planar graph G can be drawn planar on an (2n \Gamma 6) \Theta (3n \Gamma 9) grid with minimum angle larger than 2 d radians and at most 5n \Gamma 15 bends, with d the maximum d...