6533b7dcfe1ef96bd12721d7

RESEARCH PRODUCT

Disconnected Graph Layout and the Polyomino Packing Approach

Ugur DogrusozPaulis KikustsKārlis Freivalds

subject

New approachesDiscrete mathematicsPolyominoDisconnected GraphDrawing (graphics)Computer sciencePolyominoesGraph LayoutVariation (game tree)GraphRepresentation (mathematics)AlgorithmAlgorithmsConnectivity

description

Conference name: GD: International Symposium on Graph Drawing 9th International Symposium Date of Conference: 23–26 September 2001 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. © Springer-Verlag Berlin Heidelberg 2002.

yearjournalcountryeditionlanguage
2002-01-01
https://doi.org/10.1007/3-540-45848-4_30