Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs

A straight line drawing of a graph is an open weak rectangle-of-influence (RI) drawing if there is no vertex in the relative interior of the axis parallel rectangle induced by the end points of each edge. Despite recent interest of the graph drawing community in rectangle-of-influence drawings, no algorithm is known to test whether a graph has a planar open weak RI-drawing. In a recent paper, we showed how to test, for inner-triangulated planar graphs, whether they have a planar open weak RI-drawing with a non-aligned frame, i.e., the graph obtained from removing the interior of every filled triangle is drawn such that no two vertices have the same coordinate. In this paper, we generalize this to all planar graphs with a fixed planar embedding, even if some interior faces are not triangles. On the other hand, we show that if the planar embedding is not fixed, then deciding if a given planar graph has an open weak RI-drawing is NP-complete. NP-completeness holds even for open weak RI-drawings with non-aligned frames.

[1]  Henk Meijer,et al.  Rectangle of Influence Drawings of Graphs without Filled 3-Cycles , 1999, Graph Drawing.

[2]  Goos Kant,et al.  On Triangulating Planar Graphs under the Four-Connectivity Constraint , 1994, Algorithmica.

[3]  Therese C. Biedl,et al.  Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames , 2011, Graph Drawing.

[4]  Andreas Karrenbauer,et al.  Accelerated Bend Minimization , 2012, J. Graph Algorithms Appl..

[5]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[6]  Dorothea Wagner,et al.  Drawing Graphs on Two and Three Lines , 2002, J. Graph Algorithms Appl..

[7]  Roberto Tamassia,et al.  Handbook of Graph Drawing and Visualization (Discrete Mathematics and Its Applications) , 2007 .

[8]  Sadish Sadasivam,et al.  Closed Rectangle-of-Influence Drawings for Irreducible Triangulations , 2010, TAMC.

[9]  Takao Nishizeki,et al.  Rectangle-of-Influence Drawings of Four-Connected Plane Graphs , 2005, APVIS.

[10]  Nishizeki Takao,et al.  Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs , 2006 .

[11]  Giuseppe Liotta,et al.  The rectangle of influence drawability problem , 1996, Comput. Geom..

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

[13]  Takao Nishizeki,et al.  Inner Rectangular Drawings of Plane Graphs , 2004, Int. J. Comput. Geom. Appl..

[14]  Md. Saidur Rahman,et al.  Planar Graph Drawing , 2004, Lecture Notes Series on Computing.

[15]  Huaming Zhang,et al.  On Open Rectangle-of-Influence and Rectangular Dual Drawings of Plane Graphs , 2009, Discret. Math. Algorithms Appl..