Abstract
This paper is motivated by empirical research that has shown that increasing the angle of edge crossings reduces the negative effect of crossings on human readability. We investigate circular graph drawings (where each vertex lies on a circle) with large crossing angles. In particular, we consider the case of right angle crossing (RAC) drawings, where each crossing angle is π/2.
We characterize circular RAC graphs that admit a circular RAC drawing, and present a linear-time algorithm for constructing such a drawing, if it exists. We also describe a quadratic programming approach to construct circular drawings that maximise crossing angles. This method significantly increases crossing angles compared to the traditional equal-spacing algorithm.
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.
Similar content being viewed by others
References
The Rome graphs (2010), http://www.graphdrawing.org/data/index.html
Argyriou, E.N., Bekos, M.A., Symvonis, A.: The Straight-Line RAC Drawing Problem Is NP-Hard. In: Černá, I., Gyimóthy, T., Hromkovič, J., Jefferey, K., Králović, R., Vukolić, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 74–85. Springer, Heidelberg (2011)
Baur, M., Brandes, U.: Crossing Reduction in Circular Layouts. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 332–343. Springer, Heidelberg (2004)
Reisi Dehkordi, H., Eades, P.: Every outer-1-plane graph has a right angle crossing drawing. International Journal of Computational Geometry and Applications (to appear, 2012)
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall (July 1998)
Didimo, W., Eades, P., Liotta, G.: Drawing Graphs with Right Angle Crossings. In: Dehne, F., Gavrilova, M., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 206–217. Springer, Heidelberg (2009)
Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. Theoretical Computer Science 412(39), 5156–5166 (2011)
Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. In: Computing: The Australasian Theory Symposium (2010)
Eades, P., Liotta, G.: Right Angle Crossing Graphs and 1-Planarity. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 148–153. Springer, Heidelberg (2012)
Di Giacomo, E., Didimo, W., Eades, P., Liotta, G.: 2-Layer Right Angle Crossing Drawings. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol. 7056, pp. 156–169. Springer, Heidelberg (2011)
Huang, W., Hong, S.H., Eades, P.: Effects of crossing angles. In: Proceedings of PacificVis, pp. 41–46 (2008)
Nguyen, Q., Eades, P., Hong, S.-H., Huang, W.: Large Crossing Angles in Circular Layouts. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 397–399. Springer, Heidelberg (2011)
Purchase, H.C., Cohen, R.F., James, M.: Validating Graph Drawing Aesthetics. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 435–446. Springer, Heidelberg (1996)
Reisi Dehkordi, H., Nguyen, Q., Eades, P., Hong, S.H.: Circular graph drawings with large crossing angles. Technical Report TR691, School of Information Technologies, University of Sydney
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reisi Dehkordi, H., Nguyen, Q., Eades, P., Hong, SH. (2013). Circular Graph Drawings with Large Crossing Angles. In: Ghosh, S.K., Tokuyama, T. (eds) WALCOM: Algorithms and Computation. WALCOM 2013. Lecture Notes in Computer Science, vol 7748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36065-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-36065-7_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36064-0
Online ISBN: 978-3-642-36065-7
eBook Packages: Computer ScienceComputer Science (R0)