Orthogonal connector routing

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

Volumn 5849 LNCS, Issue , 2010, Pages 219-231

  Wybrow, Michael ^a   Marriott, Kim ^a   Stuckey, Peter J ^b  

^a MONASH UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

AD-HOC HEURISTICS; AUTOMATIC CONNECTORS; COMMON NETWORKS; INTERACTIVE DIAGRAMS; MONOTONIC FUNCTIONS; ROUTINGS;

COMPUTATION THEORY; DRAWING (GRAPHICS);

ORTHOGONAL FUNCTIONS;

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

References (13)

1. 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)
2. 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)
3. Dwyer, T., Marriott, K., Stuckey, P.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 153-164. Springer, Heidelberg (2006)
4. Dwyer, T., Marriott, K., Stuckey, P.: Fast node overlap removal - correction. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 446-447. Springer, Heidelberg (2007)
5. Miriyala, K., Hornick, S.W., Tamassia, R.: An incremental approach to aesthetic graph layout. In: CASE 1993, pp. 297-308. IEEE Computer Society, Los Alamitos (1993)
6. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Inc., Englewood Cliffs (1999)
7. Biedl, T.C., Madden, B., Tollis, I.G.: The three-phase method: A unified approach to orthogonal graph drawing. IJCGA 10(6), 553-580 (2000)
8. Lee, D., Yang, C., Wong, C.: Rectilinear paths among rectilinear obstacles. Discrete Applied Mathematics 70(3), 185-216 (1996)
9. Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. JohnWiley & Sons, Inc., New York (1990)
10. Lee, C.Y.: An algorithm for path connections and its applications. IRE Transactions on Electronic Computers EC-10(2), 346-365 (1961)
11. Wu, Y.F., Widmayer, P., Schlag, M.D.F., Wong, C.K.: Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles. IEEE Transactions on Computers 36(3), 321-331 (1987) (Pubitemid 17549052)
12. Argyriou, E., Bekos, M., Kaufmann, M., Symvonis, A.: Two polynomial time algorithms for the metro-line crossing minimization problem. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 336-347. Springer, Heidelberg (2009)
13. Bekos, M., Kaufmann, M., Potika, K., Symvonis, A.: Line crossing minimization on metro maps. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 231-242. Springer, Heidelberg (2008)