Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings

Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Meijer, Henk (2010) Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 15-20 (Official URL:

Full text not available from this repository.


In this paper we study non-planar drawings of graphs, and study tradeoffs between the crossing resolution (i.e., the minimum angle formed by two crossing segments), the curve complexity (i.e., maximum number of bends per edge), the total number of bends, and the area.

Item Type:Conference Paper
Additional Information:10.1007/978-3-642-11805-0_4
Classifications:G Algorithms and Complexity > G.420 Crossings
G Algorithms and Complexity > G.070 Area / Edge Length
G Algorithms and Complexity > G.210 Bends
ID Code:1076

Repository Staff Only: item control page


Didimo, W., Eades, P., Liotta, G.: Drawing Graphs with Right Angle Crossings. In: Dehne, F., et al. (eds.) WADS 2009. LNCS, vol. 5664, pp. 206–217. Springer, Heidelberg (2009)

Erdös, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Math. 2, 463–470 (1935)

Huang, W.: Using eye tracking to investigate graph layout effects. In: Hong, S.H., Ma, K.L. (eds.) APVIS, pp. 97–100. IEEE, Los Alamitos (2007)

Huang, W.: An eye tracking study into the effects of graph layout. CoRR abs/0810.4431 (2008)

Huang, W., Hong, S.H., Eades, P.: Effects of crossing angles. In: PacificVis, pp. 41–46. IEEE, Los Alamitos (2008)

Purchase, H.C.: Effective information visualisation: a study of graph drawing aesthetics and algorithms. Interacting with Computers 13(2), 147–162 (2000)

Purchase, H.C., Carrington, D.A., Allder, J.A.: Empirical evaluation of aesthetics-based graph layout. Empirical Software Engineering 7(3), 233–255 (2002)

Ware, C., Purchase, H.C., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Information Visualization 1(2), 103–110 (2002)

Wood, D.R.: Grid drawings of k-colourable graphs. Computational Geometry 30(1), 25–28 (2005)