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
TypeArticle
TitleNode overlap removal by growing a tree
AuthorsNachmanson, 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.

LanguageEnglish
PublisherBrown University * Department of Computer Science
JournalJournal of Graph Algorithms and Applications
ISSN1526-1719
Publication dates
Print01 Oct 2017
Publication process dates
Deposited05 Jul 2017
Accepted04 Jul 2017
Output statusPublished
Publisher's version
Accepted author manuscript
Digital Object Identifier (DOI)https://doi.org/10.7155/jgaa.00442
Permalink -

https://repository.mdx.ac.uk/item/87138

Download files


Publisher's version

Accepted author manuscript
  • 10
    total views
  • 7
    total downloads
  • 1
    views this month
  • 0
    downloads this month

Export as