Fast edge-routing for large graphs

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

Volumn 5849 LNCS, Issue , 2010, Pages 147-158

  Dwyer, Tim ^a   Nachmanson, Lev ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH QUALITY; LARGE GRAPHS; QUADRATIC TIME; SHORTEST PATH; VISIBILITY GRAPHS;

DRAWING (GRAPHICS); UNMANNED AERIAL VEHICLES (UAV);

VISIBILITY;

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

References (13)

1. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1999)
2. Bentley, J.L.: Multidimensional divide and conquer. Communications of the ACM 23(4), 214-229 (1980)
3. Clarkson, K.L.: Approximation algorithms for shortest path motion planning. In: STOC 1987: Nineteenth, New York (May 1987)
4. Dobkin, D.P., Gansner, E.R., Koutsofios, E., North, S.C.: Implementing a general-purpose edge router. In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 262-271. Springer, Heidelberg (1997)
5. Dwyer, T., Marriott, K., Stuckey, P.J.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 153-164. Springer, Heidelberg (2006)
6. Dwyer, T., Marriott, K., Wybrow, M.: Integrating edge routing into force-directed layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 8-19. Springer, Heidelberg (2007)
7. Dwyer, T., Marriott, K., Wybrow, M.: Topology preserving constrained graph layout. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 230-241. Springer, Heidelberg (2009), http://www.csse.monash.edu.au/~tdwyer/ topology.pdf
8. Freivalds, K.: Curved edge routing. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol. 2138, pp. 126-137. Springer, Heidelberg (2001)
9. Gansner, E.R., North, S.C.: Improved force-directed layouts. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 364-373. Springer, Heidelberg (1999)
10. Ghosh, S.K., Mount, D.M.: An output-sensitive algorithm for computing visibility. SIAM Journal on Computing 20(5), 888-910 (1991)
11. Lauther, U.: Multipole-based force approximation revisited - a simple but fast implementation using a dynamized enclosing-circle-enhanced k-d-tree. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 20-29. Springer, Heidelberg (2007)
12. Preparata, F.P., Hong, S.J.: Convex hulls of finite sets of points in two and three dimensions. Communications of the ACM 20(2), 87-92 (1977)
13. Wybrow, M., Marriott, K., Stuckey, P.J.: Incremental connector routing. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 446-457. Springer, Heidelberg (2006)