Node overlap removal by growing a tree

Nachmanson, Lev and Nocaj, Arlind and Bereg, Sergey and Zhang, Leishi and Holroyd, Alexander (2017) Node overlap removal by growing a tree. Journal of Graph Algorithms and Applications . ISSN 1526-1719 (Accepted/In press)

[img] PDF - Final accepted version (with author's formatting)
Restricted to Repository staff and depositor only

Download (4MB)
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 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: 11 Sep 2017 14:28
URI: http://eprints.mdx.ac.uk/id/eprint/22195

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