Force-directed Lombardi-style graph drawing

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

Volumn 7034 LNCS, Issue , 2012, Pages 320-331

  Chernobelskiy, Roman ^a   Cunningham, Kathryn I ^a   Goodrich, Michael T ^b   Kobourov, Stephen G ^a   Trott, Lowell ^b  

^a University of Arizona   (United States)

^b Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANGULAR RESOLUTION; CIRCULAR ARC; EDGE PLACEMENT; FORCE-DIRECTED; GRAPH DRAWING; CURVED EDGES;

ALGORITHMS; DRAWING (GRAPHICS);

DRAWING (GRAPHICS); DIRECTED GRAPHS;

EID: 84455189561     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25878-7_31     Document Type: Conference Paper

References (28)

1. Brandenburg, F., Himsolt, M., Rohrer, C.: An Experimental Comparison of Force-Directed And Randomized Graph Drawing Algorithms. In: North, S.C. (ed.) GD 1996. LNCS, vol. 1190, pp. 76-87. Springer, Heidelberg (1997)
2. Brandes, U.: Drawing on Physical Analogies. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol. 2025, pp. 71-86. Springer, Heidelberg (2001) (Pubitemid 33267301)
3. Brandes, U., Schlieper, B.: Angle and Distance Constraints On Tree Drawings. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 54-65. Springer, Heidelberg (2007)
4. Brandes, U., Shubina, G., Tamassia, R.: Improving angular resolution in visualizations of geographic networks. In: 2nd TCVG Symp. Visualization, pp. 23-32 (2000)
5. Brandes, U., Wagner, D.: Using Graph Layout to Visualize Train Interconnection Data. J. Graph Algorithms Appl. 4(3), 135-155 (2000) (Pubitemid 39064649)
6. Cheng, C.C., Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Drawing planar graphs with circular arcs. Discrete Comput. Geom. 25(3), 405-418 (2001)
7. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall PTR, Upper Saddle River (1998)
8. Di Battista, G., Vismara, L.: Angles of planar triangular graphs. SIAM J. Discrete Math. 9(3), 349-359 (1996) (Pubitemid 126556966)
9. Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent drawings: Visualizing non-planar diagrams in a planar way. J. Graph Algorithms Appl. 9(1), 31-52 (2005) (Pubitemid 41597150)
10. Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Löffler, M.: Planar and Poly-Arc Lombardi Drawings. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 308-319. Springer, Heidelberg (2011)
11. Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Nöllenburg, M.: Drawing Trees with Perfect Angular Resolution and Polynomial Area. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 183-194. Springer, Heidelberg (2011)
12. Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Nöllenburg, M.: Lombardi Drawings of Graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 195-207. Springer, Heidelberg (2011)
13. Eades, P.: A heuristic for graph drawing. Congressus Numerantium 42, 149-160 (1984)
14. Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent layered drawings. Algorithmica 47(4), 439-452 (2007) (Pubitemid 46479913)
15. Finkel, B., Tamassia, R.: Curvilinear Graph Drawing Using the Force-Directed Method. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 448-453. Springer, Heidelberg (2005)
16. Fruchterman, T., Reingold, E.: Graph drawing by force-directed placement. Softw. - Pract. Exp. 21(11), 1129-1164 (1991)
17. Gajer, P., Goodrich, M.T., Kobourov, S.G.: A multi-dimensional approach to force-directed layouts of large graphs. Comp. Geometry: Theory and Applications 29(1), 3-18 (2004)
18. Gajer, P., Kobourov, S.G.: GRIP: Graph dRawing with Intelligent Placement. Journal of Graph Algorithms and Applications 6(3), 203-224 (2002) (Pubitemid 39064679)
19. Garg, A., Tamassia, R.: Planar drawings and angular resolution: algorithms and bounds. In: 2nd European Symposium on Algorithms, London, UK, pp. 12-23 (1994)
20. Goodrich, M.T., Wagner, C.G.: A framework for drawing planar graphs with curves and polylines. J. Algorithms 37(2), 399-421 (2000)
21. 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)
22. Hirsch, M., Meijer, H., Rappaport, D.: Biclique Edge Cover Graphs and Confluent Drawings. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 405-416. Springer, Heidelberg (2007)
23. Holten, D., van Wijk, J.J.: Force-directed edge bundling for graph visualization. Computer Graphics Forum 28, 983-990 (2009)
24. Lombardi, M., Hobbs, R.: Mark Lombardi: Global Networks. Independent Curators (2003)
25. Malitz, S., Papakostas, A.: On the angular resolution of planar graphs. SIAM J. Discrete Math. 7(2), 172-183 (1994)
26. Matsakis, N.: Transforming a random graph drawing into a Lombardi drawing. arXiv ePrints, abs/1012.2202 (2010)
27. Purchase, H.: Which Aesthetic Has The Greatest Effect On Human Understanding? In: Di-Battista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248-261. Springer, Heidelberg (1997) (Pubitemid 128012910)
28. Purchase, H.C., Cohen, R.F., James, M.: Validating Graph Drawing Aesthetics. In: North, S.C. (ed.) GD 1996. LNCS, vol. 1190, pp. 435-446. Springer, Heidelberg (1997) (Pubitemid 126025111)