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..
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ackerman, E., Fulek, R., Tóth, C.D.: On the size of graphs that admit polyline drawings with few bends and crossing angles. In: Proc. 18th Sympos. on Graph Drawing. LNCS, Springer, Heidelberg (2010)
Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. J. Combin. Theory Ser. A 114(3), 563–571 (2007)
Ajtai, M., Chvátal, V., Newborn, M.M., Szemerédi, E.: Crossing-free subgraphs. In: Theory and practice of combinatorics. North-Holland Math. Stud., vol. 60, pp. 9–12. North-Holland, Amsterdam (1982)
Angelini, P., Cittadini, L., Di Battista, G., Didimo, W., Frati, F., Kaufmann, M., Symvonis, A.: On the perspectives opened by right angle crossing drawings. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 21–32. Springer, Heidelberg (2010)
Appel, K., Haken, W.: The solution of the four-color-map problem. Sci. Amer. 237(4), 108–121 (1977)
Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Area, curve complexity, and crossing resolution of non-planar graph drawings. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 15–20. Springer, Heidelberg (2010) (to appear)
Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. In: Proc. 11th WADS. LNCS, vol. 5664, pp. 206–217. Springer, Heidelberg (2009)
Dujmović, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. In: Proc. Computing: The Australian Theory Sympos.(CATS). CRPIT, ACS (2010) (to appear), http://arxiv.org/abs/0908.3545
Hlinený, P.: Discharging technique in practice, Lecture text for Spring School on Combinatorics
Huang, W.: Using eye tracking to investigate graph layout effects. In: 6th Asia-Pacific Sympos. Visualization (APVIS 2007), pp. 97–100 (2007)
Huang, W., Hong, S.-H., Eades, P.: Effects of crossing angles. In: Proc. IEEE Pacific Visualization Sympos., pp. 41–46 (2008)
Leighton, F.T.: Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks. MIT Press, Cambridge (1983)
Pach, J., Radoičić, R., Tardos, G., Tóth, G.: Improving the crossing lemma by finding more crossings in sparse graphs. Discrete Comput. Geom. 36(4), 527–552 (2006)
Wernicke, P.: Über den kartographischen Vierfarbensatz. Math. Ann. 58(3), 413–426 (1904)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arikushi, K., Fulek, R., Keszegh, B., Morić, F., Tóth, C.D. (2010). Graphs that Admit Right Angle Crossing Drawings. In: Thilikos, D.M. (eds) Graph Theoretic Concepts in Computer Science. WG 2010. Lecture Notes in Computer Science, vol 6410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16926-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-16926-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16925-0
Online ISBN: 978-3-642-16926-7
eBook Packages: Computer ScienceComputer Science (R0)