Maximizing the total resolution of graphs

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

Volumn 6502 LNCS, Issue , 2011, Pages 62-67

  Argyriou, Evmorfia N ^a   Bekos, Michael A ^a   Symvonis, Antonios ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

2-LAYERED DRAWING; ANGULAR RESOLUTION; ASYMPTOTICALLY OPTIMAL; COMPLETE BIPARTITE GRAPHS; COMPLETE GRAPHS; EDGE CROSSING; FORCE-DIRECTED; GRAPH DRAWING; MAJOR FACTORS;

DRAWING (GRAPHICS); OPTIMIZATION;

GRAPH THEORY;

EID: 79952266858     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18469-7_6     Document Type: Conference Paper

References (16)

1. 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)
2. Argyriou, E.N., Bekos, M.A., Symvonis, A.: Maximizing the total resolution of graphs. Technical Report arXiv:/106871 (2010)
3. Bárány, I., Tokushige, N.: The minimum area of convex lattice n-gons. Combinatorica 24(2), 171-185 (2004)
4. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. 4, 235-282 (1994)
5. Cheng, C.C., Duncanyz, C.A., Goodrichz, M.T., Kobourovz, S.G.: Drawing planar graphs with circular arcs. Discrete and Comp. Geometry 25, 117-126 (1999)
6. 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)
7. 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)
8. Eades, P.: A heuristic for graph drawing. Congressus Numerantium (42), 149-160 (1984)
9. Formann, M., Hagerup, T., Haralambides, J., Kaufmann, M., Leighton, F., Symvonis, A., Welzl, E., Woeginger, G.: Drawing graphs in the plane with high resolution. SIAM J. Comput. 22(5), 1035-1052 (1993)
10. Garg, A., Tamassia, R.: Planar drawings and angular resolution: Algorithms and bounds. In: Proc. 2nd Annu. Eur. Sympos. Alg., pp. 12-23 (1994)
11. Gutwenger, C., Mutzel, P.: Planar polyline drawings with good angular resolution. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 167-182. Springer, Heidelberg (1999)
12. Huang, W.: Using eye tracking to investigate graph layout effects. In: Proc. Asia-Pacific Symp. on Visualization, pp. 97-100 (2007)
13. Huang, W., Hong, S.-H., Eades, P.: Effects of crossing angles. In: Proc. of the Pacific Visualization Symp., pp. 41-46 (2008)
14. Kaufmann, M., Wagner, D. (eds.): Drawing Graphs: Methods and Models. LNCS, vol. 2025. Springer, Heidelberg (2001)
15. Lin, C.-C., Yen, H.-C.: A new force-directed graph drawing method based on edge-edge repulsion. In: Proc. of the 9th Int. Conf. on Inf. Vis., pp. 329-334. IEEE, Los Alamitos (2005)
16. Malitz, S.M., Papakostas, A.: On the angular resolution of planar graphs. In: STOC, pp. 527-538 (1992)