Efficient Node Overlap Removal Using a Proximity Stress Model

  • Emden R. Gansner
  • Yifan Hu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5417)

Abstract

When drawing graphs whose nodes contain text or graphics, the nontrivial node sizes must be taken into account, either as part of the initial layout or as a post-processing step. The core problem is to avoid overlaps while retaining the structural information inherent in a layout using little additional area. This paper presents a new node overlap removal algorithm that does well by these measures.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Emden R. Gansner
    • 1
  • Yifan Hu
    • 1
  1. 1.AT&T LabsShannon LaboratoryFlorham ParkUSA

Personalised recommendations