Node overlap removal by growing a tree

Nachmanson, Lev and Nocaj, Arlind and Bereg, Sergey and Zhang, Leishi and Holroyd, Alexander (2016) Node overlap removal by growing a tree. In: GD16, 24th International Symposium on Graph Drawing & Network Visualization, 19-21 September 2016, Athens, Greece.

[img]
Preview
PDF - Final accepted version (with author's formatting)
Download (4MB) | Preview
This item is available in: Library Catalogue

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 produces high quality layouts. According to our experiments it runs several times faster than the current state-of-the-art methods.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Nachmanson L., Nocaj A., Bereg S., Zhang L., Holroyd A. (2016) Node Overlap Removal by Growing a Tree. In: Hu Y., Nöllenburg M. (eds) Graph Drawing and Network Visualization. GD 2016. Lecture Notes in Computer Science, vol 9801. Springer, Cham
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 20766
Notes on copyright: The final publication is available at Springer via http://doi.org/10.1007/978-3-319-50106-2_3
Useful Links:
Depositing User: Leishi Zhang
Date Deposited: 24 Oct 2016 13:44
Last Modified: 10 May 2017 09:38
URI: http://eprints.mdx.ac.uk/id/eprint/20766

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year