Drawing Graphs with Right Angle Crossings
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Orthogeodesic point-set embedding of trees
GD'11 Proceedings of the 19th international conference on Graph Drawing
| Hi-index | 0.00 |
In point-set-embeddability (PSE) problems one is given not just a graph that is to be drawn, but also a set of points in the plane that specify where the vertices of the graph can be placed. The problem class was introduced by Gritzmann et al. [3] twenty years ago. In their work and most other works on PSE problems, however, planarity of the output drawing was an essential requirement. Recent experiments on the readability of drawings [4] showed that polyline drawings with angles at edge crossings close to 90°. and a small number of bends per edge are just as readable as planar drawings. Motivated by these findings, Didimo et al. [2] recently introduced RAC drawings where pairs of crossing edges must form a right angle and, more generally, αAC drawings (for α∈ (0, 90°]) where the crossing angle must be at least α. As usual, edges may not overlap and may not go through vertices. We investigate the intersection of PSE and RAC/αAC.