The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs

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.

[1]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[2]  Michael Kaufmann,et al.  On the Perspectives Opened by Right Angle Crossing Drawings , 2009, J. Graph Algorithms Appl..

[3]  Seth M. Malitz,et al.  On the angular resolution of planar graphs , 1992, STOC '92.

[4]  Walter Didimo,et al.  Drawing graphs with right angle crossings , 2009, Theor. Comput. Sci..

[5]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[6]  Jan van Leeuwen,et al.  Algorithms — ESA '94 , 1994, Lecture Notes in Computer Science.

[7]  Roberto Tamassia,et al.  Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract) , 1994, ESA.