Journal of Graph Algorithms and Applications
http://jgaa.info ISSN: 1526-1719
|
DOI: 10.7155/jgaa.00198 Efficient, Proximity-Preserving Node Overlap Removal Emden Gansner and Yifan Hu Vol. 14, no. 1, pp. 53-74, 2010. Regular paper Abstract When drawing graphs whose nodes contain text or graphics, the non-trivial node sizes must be taken into account, either as part of the initial layout or as a post-processing step. The core problem in avoiding or removing overlaps is to retain the structural information inherent in a layout while minimizing the additional area required. This paper presents a new node overlap removal algorithm that does well at retaining a graph's shape while using little additional area and time. As part of the analysis, we consider and evaluate two measures of dissimilarity for two layouts of the same graph.
|
Final: November 2009. Submitted: November 2008. Accepted: November 2009. Reviewed: March 2009. Published: January 2010. Revised: May 2009. Communicated by Maurizio Patrignani and Ioannis Tollis |
| Journal of Graph Algorithms and Applications |