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 , pp. 124-138(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_11).

Full text not available from this repository.

Abstract

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.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-45848-4_11
Classifications: G Algorithms and Complexity > G.070 Area / Edge Length
P Styles > P.600 Poly-line > P.600.700 Orthogonal
URI: http://gdea.informatik.uni-koeln.de/id/eprint/492

Actions (login required)

View Item View Item