Node overlap removal by growing a tree
Article
Nachmanson, L., Nocaj, A., Bereg, S., Zhang, L. and Holroyd, A. 2017. Node overlap removal by growing a tree. Journal of Graph Algorithms and Applications. 21 (5), pp. 857-872. https://doi.org/10.7155/jgaa.00442
Type | Article |
---|---|
Title | Node overlap removal by growing a tree |
Authors | Nachmanson, L., Nocaj, A., Bereg, S., Zhang, L. and Holroyd, A. |
Abstract | Node overlap removal is a necessary step in many scenarios including laying out a graph, or visualizing a tag cloud. Our contribution is a new overlap removal algorithm that iteratively builds a Minimum Spanning Tree on a Delaunay triangulation of the node centers and removes the node overlaps by \growing" the tree. The algorithm is simple to implement, yet it produces high quality layouts. According to our experiments it runs several times faster than the current state-of-the-art methods. |
Publisher | Brown University * Department of Computer Science |
Journal | Journal of Graph Algorithms and Applications |
ISSN | 1526-1719 |
Publication dates | |
01 Oct 2017 | |
Publication process dates | |
Deposited | 05 Jul 2017 |
Accepted | 04 Jul 2017 |
Output status | Published |
Publisher's version | |
Accepted author manuscript | |
Digital Object Identifier (DOI) | https://doi.org/10.7155/jgaa.00442 |
Language | English |
Permalink -
https://repository.mdx.ac.uk/item/87138
Download files
14
total views28
total downloads1
views this month4
downloads this month