Height-Preserving Transformations of Planar Graph Drawings

There are numerous styles of planar graph drawings, such as straight-line drawings, poly-line drawings, orthogonal graph drawings and visibility representations. Given a planar drawing in one of these styles, can it be converted it to another style while keeping the height unchanged? This paper answers this question for nearly all pairs of these styles, as well as for related styles that additionally restrict edges to be y-monotone and/or vertices to be horizontal line segments. These transformations can be used to develop new graph drawing results, especially for height-optimal drawings.

[1]  Michael Hoffmann,et al.  Quality Ratios of Measures for Graph Drawing Styles , 2014, CCCG.

[2]  Stephen K. Wismath,et al.  Characterizing bar line-of-sight graphs , 1985, SCG '85.

[3]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[4]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[5]  Valentine Kabanets,et al.  Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits , 2015, COCOON.

[6]  János Pach,et al.  Monotone drawings of planar graphs , 2002, J. Graph Theory.

[7]  Markus Chimani,et al.  Upward Planarity Testing via SAT , 2012, GD.

[8]  Giuseppe Liotta,et al.  On the Parameterized Complexity of Layered Graph Drawing , 2001, Algorithmica.

[9]  Robert E. Tarjan,et al.  Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..

[10]  Goos Kant,et al.  Drawing planar graphs using the canonical ordering , 1996, Algorithmica.

[11]  R. Tamassia,et al.  Upward planarity testing , 1995 .

[12]  Giuseppe Liotta,et al.  On the Parameterized Complexity of Layered Graph Drawing , 2001, ESA.

[13]  Anna Lubiw,et al.  Morphing orthogonal planar graph drawings , 2013, SODA '06.

[14]  Martin Nöllenburg,et al.  Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings , 2013, Graph Drawing.

[15]  Roberto Tamassia,et al.  A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..

[16]  Goos Kant,et al.  A better heuristic for orthogonal graph drawings , 1998, Comput. Geom..

[17]  Shin-Ichi Nakano,et al.  Convex Grid Drawings of Four-connected Plane Graphs , 2006, Int. J. Found. Comput. Sci..

[18]  Manu Basavaraju,et al.  2-connecting Outerplanar Graphs without Blowing Up the Pathwidth , 2013, COCOON.

[19]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[20]  Michael Kaufmann,et al.  Drawing Planar Partitions II: HH-Drawings , 1998, WG.

[21]  Therese C. Biedl.  A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs , 2012, WAOA.

[22]  Roberto Tamassia,et al.  On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..

[23]  János Pach,et al.  Monotone drawings of planar graphs , 2004 .

[24]  Xin He,et al.  Compact visibility representation of 4-connected plane graphs , 2012, Theor. Comput. Sci..