Drawing graphs with right angle crossings (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5664 LNCS, Issue , 2009, Pages 206-217

  Didimo, Walter ^a   Eades, Peter ^b   Liotta, Giuseppe ^a  

^a UNIVERSITY OF PERUGIA   (Italy)

^b UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE CROSSING; EXTENDED ABSTRACTS; GRAPH DRAWING; GRAPH VISUALIZATION; INPUT GRAPHS; PLANAR DRAWING; UPPER AND LOWER BOUNDS;

ALGORITHMS; COMBINATORIAL MATHEMATICS; CONTROL THEORY; CROSSINGS (PIPE AND CABLE); DATA STRUCTURES; DRAWING (GRAPHICS);

GRAPH THEORY;

EID: 69949156945     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03367-4_19     Document Type: Conference Paper

References (21)

1. Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. J. Comb. Theory, Ser. A 114(3), 563-571 (2007)
2. Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica 17(1), 1-9 (1997)
3. Brightwell, G., Scheinerman, E.R.: Representations of planar graphs. SIAM J. Discrete Math. 6(2), 214-229 (1993)
4. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)
5. Felsner, S.: Triangles in euclidean arrangements. Discrete & Computational Geometry 22(3), 429-438 (1999)
6. Huang, W.: Using eye tracking to investigate graph layout effects. In: APVIS, pp. 97-100 (2007)
7. Huang, W.: An eye tracking study into the effects of graph layout. CoRR, abs/0810.4431 (2008)
8. Huang, W., Hong, S.-H., Eades, P.: Effects of crossing angles. In: PacificVis, pp. 41-46 (2008)
9. Jünger, M., Mutzel, P. (eds.): Graph Drawing Software. Springer, Heidelberg (2003)
10. Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. Springer, Heidelberg (2001)
11. Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)
12. Pach, J.: Geometric graph theory. In: Handbook of Discrete and Computational Geometry, pp. 219-238. CRC Press, Boca Raton (2004)
13. Pach, J., Radoicic, R., Tardos, G., Tóth, G.: Improving the crossing lemma by finding more crossings in sparse graphs. Discrete & Computational Geometry 36(4), 527-552 (2006)
14. Pach, J., Radoicic, R., Tóth, G.: Relaxing planarity for topological graphs. In: Akiyama, J., Kano, M. (eds.) JCDCG 2002. LNCS, vol. 2866, pp. 221-232. Springer, Heidelberg (2003)
15. Papakostas, A., Tollis, I.G.: Efficient orthogonal drawings of high degree graphs. Algorithmica 26(1), 100-125 (2000)
16. Purchase, H.C.: Effective information visualisation: a study of graph drawing aesthetics and algorithms. Interacting with Computers 13(2), 147-162 (2000)
17. Purchase, H.C., Carrington, D.A., Allder, J.-A.: Empirical evaluation of aesthetics-based graph layout. Empirical Software Engineering 7(3), 233-255 (2002)
18. Roudneff, J.-P.: The maximum number of triangles in arrangements of pseudolines. J. Comb. Theory, Ser. B 66(1), 44-74 (1996)
19. Tamassia, R., Tollis, I.G.: Planar grid embedding in linear time. IEEE Trans. Circuit Syst. CAS-36(9), 1230-1234 (1989)
20. Vignelli, M.: New york subway map, http://www.mensvogue.com/design/ articles/2008/05/vignelli
21. Ware, C., Purchase, H.C., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Information Visualization 1(2), 103-110 (2002)