On the Angular Resolution of Planar Graphs
SIAM Journal on Discrete Mathematics
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Drawing Graphs with Right Angle Crossings
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On the perspectives opened by right angle crossing drawings
GD'09 Proceedings of the 17th international conference on Graph Drawing
The straight-line RAC drawing problem is NP-hard
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
2-Layer right angle crossing drawings
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Right angle crossing graphs and 1-planarity
GD'11 Proceedings of the 19th international conference on Graph Drawing
Heuristics for the maximum 2-layer RAC subgraph problem
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Vertex angle and crossing angle resolution of leveled tree drawings
Information Processing Letters
Right angle crossing graphs and 1-planarity
Discrete Applied Mathematics
| Hi-index | 0.00 |
We study how much better a right-angled crossing (RAC) drawing of a planar graph can be than any planar drawing of the same planar graph. We analyze the area requirement, the edge-length ratio, and the angular resolution. For the first two measures, a RAC drawing can be arbitrarily much better, whereas for the third measure a RAC drawing can be 2.75 times as good.