Fast node overlap removal

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

Volumn 3843 LNCS, Issue , 2006, Pages 153-164

  Dwyer, Tim ^a   Marriott, Kim ^a   Stuckey, Peter J ^b  

^a MONASH UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Constrained optimization; Graph layout; Separation constraints

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; NUMERICAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

CONSTRAINED OPTIMIZATION; CONSTRAINT GENERATION ALGORITHMS; GRAPH LAYOUT; SEPARATION CONSTRAINTS;

GRAPH THEORY;

EID: 33745650498     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11618058_15     Document Type: Conference Paper

References (16)

1. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall (1999)
2. Harel, D., Koren, Y.: Drawing graphs with non-uniform vertices. In: Proceedings of the Working Conference on Advanced Visual Interfaces (AVI'02), ACM Press (2002) 157-166
3. Friedrich, C., Schreiber, F.: Flexible layering in hierarchical drawings with nodes of arbitrary size. In: Proceedings of the 27th conference on Australasian computer science (ACSC2004). Volume 26., Australian Computer Society (2004) 369-376
4. Marriott, K., Moulder, P., Hope, L., Twardy, C.: Layout of bayesian networks. In: Twenty-Eighth Australasian Computer Science Conference (ACSC2005). Volume 38 of CRPIT., Australian Computer Society (2005) 97-106
5. Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. Journal of Visual Languages and Computing 6 (1995) 183-210
6. Marriott, K., Stuckey, P., Tam, V., He, W.: Removing node overlapping in graph layout using constrained optimization. Constraints 8 (2003) 143-171
7. Hayashi, K., Inoue, M., Masuzawa, T., Fujiwara, H.: A layout adjustment problem for disjoint rectangles preserving orthogonal order. In: GD '98: Proceedings of the 6th International Symposium on Graph Drawing, London, UK, Springer-Verlag (1998) 183-197
8. Lai, W., Eades, P.: Removing edge-node intersections in drawings of graphs. Inf. Process. Lett. 81 (2002) 105-110
9. Gansner, E.R., North, S.C.: Improved force-directed layouts. In: GD '98: Proceedings of the 6th International Symposium on Graph Drawing, London, UK, Springer-Verlag (1998) 364-373
10. Lyons, K.A.: Cluster busting in anchored graph drawing. In: GASCON '92: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research, IBM Press (1992) 327-337
11. Li, W., Eades, P., Nikolov, N.: Using spring algorithms to remove node overlapping. In: Proceedings of the Asia-Pacific Symposium on Information Visualisation (APVIS2005). Volume 45 of CRPIT., Australian Computer Society (2005) 131-140
12. Preparata, F.P., Shamos, M.I. In: Computational Geometry. Springer (1985) 359-365
13. Dwyer, T., Marriott, K., Stuckey, P.J.: Fast node overlap removal. Technical Report 2005/173, Monash University, School of Computer Science and Software Engineering (2005) Available from www.csse.monash.edu.au/~tdwyer.
14. Weiss, M.A.: Data Structures and Algorithm Analysis in Java. Addison Wesley Longman (1999)
15. Fletcher, R.: Practical Methods of Optimization. Chichester: John Wiley & Sons, Inc. (1987)
16. ApS, M.: (Mosek optimisation toolkit v3.2) www.mosek.com.