On the perspectives opened by right angle crossing drawings

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

Volumn 5849 LNCS, Issue , 2010, Pages 21-32

  Angelini, Patrizio ^a   Cittadini, Luca ^a   Di Battista, Giuseppe ^a   Didimo, Walter ^b   Frati, Fabrizio ^a   Kaufmann, Michael ^c   Symvonis, Antonios ^d  

^a ROMA TRE UNIVERSITY   (Italy)

^b UNIVERSITY OF PERUGIA   (Italy)

^c UNIVERSITY OF TÜBINGEN   (Germany)

^d NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION PROBLEMS; DEGREE GRAPHS; EMBEDDED GRAPHS; NP-HARD; PLANAR DIGRAPHS; PLANAR EMBEDDINGS; PLANAR GRAPH;

DRAWING (GRAPHICS);

EID: 77951518782     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11805-0_5     Document Type: Conference Paper

References (19)

1. Bárány, I., Tokushige, N.: The minimum area of convex lattice n-gons. Combinatorica 24(2), 171-185 (2004)
2. Berge, C.: Graphs. North Holland, Amsterdam (1985)
3. de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41-51 (1990)
4. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)
5. Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science 61, 175-198 (1988)
6. Di Battista, G., Tamassia, R., Tollis, I.G.: Area requirement and symmetry display of planar upward drawings. Discrete & Computational Geometry 7, 381-401 (1992)
7. Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. In: WADS 2009. LNCS, vol. 5664, pp. 206-217. Springer, Heidelberg (2009)
8. Eades, P., Symvonis, A., Whitesides, S.: Three-dimensional orthogonal graph drawing algorithms. Discrete Applied Mathematics 103(1-3), 55-87 (2000)
9. Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM Journal on Computing 31(2), 601-625 (2001)
10. Huang, W.: An eye tracking study into the effects of graph layout. CoRR, abs/0810.4431 (2008)
11. Huang, W., Hong, S.-H., Eades, P.: Effects of crossing angles. In: PacificVis, pp. 41-46 (2008)
12. Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. Springer, Heidelberg (2001)
13. Papakostas, A.: Upward planarity testing of outerplanar dags. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 298-306. Springer, Heidelberg (1995)
14. Papakostas, A., Tollis, I.G.: Algorithms for area-efficient orthogonal drawings. Computational Geometry 9(1-2), 83-110 (1998)
15. Petersen, J.: Die theorie der regulären graphen. Acta Mathematicae 15, 193-220 (1891)
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. Schnyder, W.: Embedding planar graphs on the grid. In: SODA 1990, pp. 138-148 (1990)
19. Ware, C., Purchase, H.C., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Information Visualization 1(2), 103-110 (2002)