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.

Abstract

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.

Item Type:Conference Paper
Additional Information:10.1007/978-3-540-70904-6_44
Classifications:G Algorithms and Complexity > G.560 Geometry
ID Code:801

Available Versions of this Item

Repository Staff Only: item control page

References

Dwyer, T., Marriott, K., Stuckey, P.: Fast node overlap removal. In: Proceedings of the 13th International Symposium on Graph Drawing (GD'05). Volume 3843 of LNCS. (2006) 153-164.

Weiss, M.A.: Data Structures and Algorithm Analysis in Java. Addison Wesley Longman (1999).

Dwyer, T., Marriott, K., Stuckey, P.: Fast node overlap removal correction. Available from: www.csse.monash.edu.au/tdwyer/FastNodeOverlapRemovalCorrection.pdf (2006).