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.
CITATION STYLE
Nachmanson, L., Nocaj, A., Bereg, S., Zhang, L., & Holroyd, A. (2016). Node overlap removal by growing a tree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9801 LNCS, pp. 33–43). Springer Verlag. https://doi.org/10.1007/978-3-319-50106-2_3
Mendeley helps you to discover research relevant for your work.