Abstract
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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Arikushi, K., Fulek, R., Keszegh, B., Morić, F., & Tóth, C. D. (2010). Graphs that admit right angle crossing drawings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6410 LNCS, pp. 135–146). https://doi.org/10.1007/978-3-642-16926-7_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
