Abstract
When drawing graphs whose nodes contain text or graphics, the nontrivial node sizes must be taken into account, either as part of the initial layout or as a post-processing step. The core problem is to avoid overlaps while retaining the structural information inherent in a layout using little additional area. This paper presents a new node overlap removal algorithm that does well by these measures. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Gansner, E. R., & Hu, Y. (2009). Efficient node overlap removal using a proximity stress model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5417 LNCS, pp. 206–217). Springer Verlag. https://doi.org/10.1007/978-3-642-00219-9_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
