Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size
Eiglsperger, Markus and Kaufmann, Michael (2002) Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 124-138 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_11).
Full text not available from this repository.
In this paper, we present a new compaction algorithm which computes orthogonal drawings where the size of the vertices is given as input. This is a critical constraint for many practical applications like UML. The algorithm provides a drastic improvement on previous approaches. It has linear worst case running time and experiments show that it performs very well in practice.
Repository Staff Only: item control page