Disconnected graph layout and the polyomino packing approach
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
378 - 391
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/27557
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.