Fast Node Overlap Removal—Correction

  • Tim Dwyer
  • Kim Marriott
  • Peter J. Stuckey
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4372)


Our recent paper [1] details an algorithm for removing overlap between rectangles, while attempting to displace the rectangles by as little as possible. The algorithm is primarily motivated by the node-overlap removal problem in graph drawing.


graph layout constrained optimization separation constraints 


  1. 1.
    Dwyer, T., Marriott, K., Stuckey, P.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 153–164. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    Weiss, M.A.: Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, Reading (1999)Google Scholar
  3. 3.
    Dwyer, T., Marriott, K., Stuckey, P.: Fast node overlap removal correction (2006), Available from,

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Tim Dwyer
    • 1
  • Kim Marriott
    • 1
  • Peter J. Stuckey
    • 2
  1. 1.Clayton School of IT, Monash UniversityAustralia
  2. 2.NICTA Victoria Laboratory, Dept. of Comp. Science & Soft. Eng., University of MelbourneAustralia

Personalised recommendations