Part of the Lecture Notes in Computer Science book series (LNCS, volume 4372)
Fast Node Overlap Removal—Correction
Our recent paper  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.
Keywordsgraph layout constrained optimization separation constraints
- 2.Weiss, M.A.: Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, Reading (1999)Google Scholar
- 3.Dwyer, T., Marriott, K., Stuckey, P.: Fast node overlap removal correction (2006), Available from, http://www.csse.monash.edu.au/~tdwyer/FastNodeOverlapRemovalCorrection.pdf
© Springer Berlin Heidelberg 2007