Large crossing angles in circular layouts

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

Volumn 6502 LNCS, Issue , 2011, Pages 397-399

  Nguyen, Quan ^a   Eades, Peter ^a   Hong, Seok Hee ^a   Huang, Weidong ^b  

^a UNIVERSITY OF SYDNEY   (Australia)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CROSSING ANGLES; EMPIRICAL RESEARCH; HUMAN READABILITY; POSTPROCESSING ALGORITHMS; RUNNING TIME; LARGE CROSSINGS;

ALGORITHMS; QUADRATIC PROGRAMMING;

DRAWING (GRAPHICS);

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

References (5)

1. cplex (2010), http://www.ilog.com/products/cplex/
2. The Rome graphs (2010), http://www.graphdrawing.org/data/index.html
3. Baur, M., Brandes, U.: Crossing reduction in circular layouts. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 332-343. Springer, Heidelberg (2004)
4. 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)
5. Huang, W., Hong, S.H., Eades, P.: Effects of crossing angles. In: IEEE Pacific Visualization Symposium, pp. 41-46 (2008)