Node Overlap Removal by Growing a Tree

Nachmanson, Lev and Nocaj, Arlind and Bereg, Sergey and Zhang, Leishi and Holroyd, Alexander E. (2016) Node Overlap Removal by Growing a Tree. In: Graph Drawing and Network Visualization. GD 2016, September, 19. - 21., 2016 , pp. 33-43(Official URL: http://dx.doi.org/10.1007/978-3-319-50106-2_3).

Full text not available from this repository.

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 produces high quality layouts. According to our experiments it runs several times faster than the current state-of-the-art methods.

Item Type: Conference Paper
Classifications: P Styles > P.720 Straight-line
S Software and Systems > S.120 Visualization
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1530

Actions (login required)

View Item View Item