Node overlap removal by growing a tree

Nachmanson, Lev, Nocaj, Arlind, Bereg, Sergey, Zhang, Leishi ORCID logoORCID: and Holroyd, Alexander (2016) Node overlap removal by growing a tree. Graph Drawing and Network Visualization: 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers. In: GD16, 24th International Symposium on Graph Drawing & Network Visualization, 19-21 September 2016, Athens, Greece. ISBN 9783319501055. ISSN 0302-9743 [Conference or Workshop Item] (doi:10.1007/978-3-319-50106-2_3)

PDF - Final accepted version (with author's formatting)
Download (4MB) | Preview


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
Useful Links:
Depositing User: Leishi Zhang
Date Deposited: 24 Oct 2016 13:44
Last Modified: 06 Jun 2022 22:44

Actions (login required)

View Item View Item


Activity Overview
6 month trend
6 month trend

Additional statistics are available via IRStats2.