Node Overlap Removal by Growing a Tree

  • Lev Nachmanson
  • Arlind Nocaj
  • Sergey Bereg
  • Leishi Zhang
  • Alexander Holroyd
Conference paper

DOI: 10.1007/978-3-319-50106-2_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9801)
Cite this paper as:
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

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.

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Lev Nachmanson
    • 1
  • Arlind Nocaj
    • 2
  • Sergey Bereg
    • 3
  • Leishi Zhang
    • 4
  • Alexander Holroyd
    • 1
  1. 1.Microsoft ResearchRedmondUSA
  2. 2.University of KonstanzKonstanzGermany
  3. 3.The University of Texas at DallasRichardsonUSA
  4. 4.Middlesex UniversityLondonUK

Personalised recommendations