Disconnected Graph Layout and the Polyomino Packing Approach

Freivalds, Karlis and Dogrusoz, Ugur and Kikusts, Paulis (2002) Disconnected Graph Layout and the Polyomino Packing Approach. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 378-391(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_30).

Full text not available from this repository.

Abstract

We review existing algorithms and present a new approach for layout of disconnected graphs. The new approach is based on polyomino representation of components as opposed to rectangles. The parameters of our algorithm and their influence on the drawings produced as well as a variation of the algorithm for multiple pages are discussed. We also analyze our algorithm both theoretically and experimentally and compare it with the existing ones. The new approach produces much more compact and uniform drawings than previous methods.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-45848-4_30
Classifications: Z Theory > Z.500 Representations
G Algorithms and Complexity > G.070 Area / Edge Length
P Styles > P.999 Others
URI: http://gdea.informatik.uni-koeln.de/id/eprint/525

Actions (login required)

View Item View Item