Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-642-00219-9_20 | Graph Drawing |
Keywords | DocType | Volume |
additional area,nontrivial node size,new node,post-processing step,efficient node overlap removal,proximity stress,structural information,initial layout,core problem,removal algorithm | Conference | 5417 |
ISSN | Citations | PageRank |
0302-9743 | 29 | 1.16 |
References | Authors | |
18 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emden R. Gansner | 1 | 1117 | 115.32 |
| Yifan Hu | 2 | 1480 | 88.96 |