Graphs that Admit Right Angle Crossing Drawings

We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a graph with n vertices admits a RAC drawing with at most 1 bend or 2 bends per edge, then the number of edges is at most 6.5n and 74.2n, respectively. This is a strengthening of a recent result of Didimo et al.

• Type: Journal
• Year: 2010
• Where: WG
• Authors: Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth
• Keywords: Didimo Et, Polygonal Arcs, Right Angle, Theoretical Computer Science, WG 2010