On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
An algorithm for building rectangular floor-plans
DAC '84 Proceedings of the 21st Design Automation Conference
Rectangle-of-influence drawings of four-connected plane graphs: extended abstract
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Closed rectangle-of-influence drawings for irreducible triangulations
Computational Geometry: Theory and Applications
Open rectangle-of-influence drawings of non-triangulated planar graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
The approximate rectangle of influence drawability problem
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
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. No algorithm is known to test whether a graph has a planar open weak RI-drawing, not even for inner triangulated graphs. In this paper, we study RI-drawings 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 give a polynomial algorithm to test whether an inner triangulated graph has a planar open weak RI-drawing with non-aligned frame.