Two-dimensional packing algorithms for layout of disconnected graphs

Dogrusoz, Ugur (2002) Two-dimensional packing algorithms for layout of disconnected graphs. [Journal (On-line/Unpaginated)]

Full text not available from this repository.

Abstract

We present and contrast several efficient two-dimensional packing algorithms for specified aspect ratio. These near-linear algorithms are based on strip packing, tiling, and alternate-bisection methodologies and can be used in the layout of disconnected objects in graph visualization. The parameters that affect the performance of these algorithms as well as the circumstances under which they perform well are analyzed.

Item Type: Journal (On-line/Unpaginated)
Additional Information: 10.1016/S0020-0255(02)00183-4
Classifications: G Algorithms and Complexity > G.560 Geometry
Z Theory > Z.250 Geometry
URI: http://gdea.informatik.uni-koeln.de/id/eprint/738

Actions (login required)

View Item View Item