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.
@article{arxiv.1608.02653,
title = {Node Overlap Removal by Growing a Tree},
author = {Lev Nachmanson and Arlind Nocaj and Sergey Bereg and Leishi Zhang and Alexander Holroyd},
journal= {arXiv preprint arXiv:1608.02653},
year = {2016}
}