Node overlap removal by growing a tree
Nachmanson, Lev, Nocaj, Arlind, Bereg, Sergey, Zhang, Leishi ORCID: https://orcid.org/0000-0002-3158-2328 and Holroyd, Alexander
(2017)
Node overlap removal by growing a tree.
Journal of Graph Algorithms and Applications, 21
(5)
.
pp. 857-872.
ISSN 1526-1719
[Article]
(doi:10.7155/jgaa.00442)
|
PDF
- Published version (with publisher's formatting)
Download (4MB) | Preview |
|
|
PDF
- Final accepted version (with author's formatting)
Download (4MB) | Preview |
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.
Item Type: | Article |
---|---|
Research Areas: | A. > School of Science and Technology > Computer Science |
Item ID: | 22195 |
Useful Links: | |
Depositing User: | Leishi Zhang |
Date Deposited: | 05 Jul 2017 14:13 |
Last Modified: | 10 Jun 2021 06:52 |
URI: | https://eprints.mdx.ac.uk/id/eprint/22195 |
Actions (login required)
![]() |
View Item |
Statistics
Additional statistics are available via IRStats2.