Arikushi, KarinFulek, RadoslavKeszegh, BalázsMoric, FilipToth, Csaba D.2010-12-302010-12-302010-12-30201010.1007/978-3-642-16926-7_14https://infoscience.epfl.ch/handle/20.500.14299/62542WOS:000289453400014We 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.DischargingCrossing lemmaPolyline drawingRight angle crossing drawingArchimedean tilingtext::conference output::conference proceedings::conference paper