Fast Node Overlap Removal - Correction
Dwyer, Tim and Marriott, Kim and Stuckey, Peter J. (2007) Fast Node Overlap Removal - Correction. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006, Karlsruhe, Germany , pp. 446-447 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_44).
This is the latest version of this item.
Full text not available from this repository.
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.
Available Versions of this Item
Repository Staff Only: item control page