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, not even for inner triangulated
graphs.
In this thesis, we have two major contributions. First we study open weak RI-drawings of plane graphs that must have 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. We introduce a new way to assign labels to angles, i.e., instances of vertices on faces. Using this labeling, we provide necessary and sufficient conditions characterizing those plane graphs that have open weak RI-drawings with non-aligned frame. We also give a polynomial algorithm to construct such a drawing if one exists.
Our second major result is a negative result: deciding if a planar graph (i.e., one where we can choose the planar embedding) has an open weak RI-drawing is NP-complete. NP-completeness holds even for open weak RI-drawings with non-aligned frames
