Using spring algorithms to remove node overlapping

Conferences in Research and Practice in Information Technology Series

Volumn 45, Issue , 2005, Pages 131-140

  Li, Wanchun ^a   Eades, Peter ^a   Nikolov, Nikola ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

Graph drawing; Node overlapping; Spring algorithm

Indexed keywords

AESTHETIC CRITERIA; GRAPH DRAWING; LAYOUT ALGORITHMS; NODE OVERLAPPING; SPRING ALGORITHMS;

ALGORITHMS; DRAWING (GRAPHICS); VISUALIZATION;

GRAPH THEORY;

EID: 84883571497     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Gansner E. & North S. (1998), Improved Force- Directed Layouts, in 'Graph Drawing', LNCS, Montreal, Canada, August 13-15, pp. 364-373.
2. Hayashi K., Inoue M., Masuzawa T., & Fujiwara H. (1998), A layout Adjustment Problem fo Dis- joint Rectangles Preserving Orthogonal Order, in 'Graph Drawing', LNCS, Montreal, Canada, August 13-15, pp. 183-197.
3. Huang X., & Lai W. (2003), Force-Transfer: A New Approach to Removing Overlapping Nodes in Graph Layout, in '25th Australian Computer Science Conference', Adelaida, Australia, 2003.
4. Kamps T., Kleinz J., & Read J. (1995), Constraint- Based Spring-Model Algorithm for Graph Lay- out, in 'Graph Drawing', LNCS, F.J. Branden- burg, Canada, 1996, pp. 349-360.
5. Generating customized layouts. in 'Graph Draw- ing', LNCS, F.J. Brandenburg, Canada, 1996, pp. 504-515.
6. Di Battista G., Eades P., Tamassia R., & Tollis I., (1998), Graph drawing: Algorithms for the visu- Alization of graphs, Prentice Hall.
7. Eades P. (1984), 'A Heuristci Graph Drawing', Congressus Numerantium 42, 1984.
8. Eades P., Lai W., Misue K., & Sugiyama K. (1995), 'Layout Adjustment and the Mental Map', Journal of Visual Languages and Computing 6, 183- 210, 1995.
9. Eades P., & Lin X. (1999), 'Spring Algorithms and Symmetry', Theoretical Computer Science 240- 2, 379-405, 2000.
10. Harel D. &Koren Y. (1999), 'Drawing Graphs with Non-Uniform Vertices', in 'Proceedings of Work- ing Conference on Advanced Visual Interfaces (AVI'02), Italy, 2002, pp. 157-166.
11. Lyons K., Meijer H., & Rappaport D., (1998), 'Al gorithms for Cluter Busting in Anchored Graph Drawing', J. Graph Algorithms and Applications 2-1, 1-24, 1998.
12. Marriott K., Stuckey P., Tam V., & He W. (1995), 'Removing Node Overlapping in Graph Layout Using Constrained Optimization', Constraints 8, 143-171, 2003.