We connect two aspects of graph drawing, namely angular resolution, and the possibility to draw with all angles an integer multiple of 2π/d. A planar graph with angular resolution at least π/2 can be drawn with all angles an integer multiple of π/2 (rectilinear). For d = 4, d > 2, an angular resolution of 2π/d does not imply that the graph can be drawn with all angles an integer multiple of 2π/d. We argue that the exceptional situation for d = 4 is due to the absence of triangles in the rectangular grid.
Bodlaender and Tel REF showed that, for d = 4, an angular resolution of 2π/d implies d-linearity and that this is not true for any d > 4.
A Note on Rectilinearity and Angular Resolution
J. Graph Algorithms Appl.
J. Graph Algorithms Appl.
Mathematics Computer Science