Disconnected Graph Layout and the Polyomino Packing Approach
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.
- 2.E. G. Coffman, M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: An updated survey. In G. Ausiello, M. Lucertini, and P. Serafini, editors, Algorithm Design for Computer System Design, pages 49–106. Springer-Verlag, New York, 1984.Google Scholar
- 6.U. Dogrusoz. Algorithms for layout of disconnected graphs. Information Sciences, to appear.Google Scholar
- 7.U. Dogrusoz, M. Doorley, Q. Feng, A. Frick, B. Madden, and G. Sander. Toolkits for development of software diagramming applications. IEEE Computer Graphics and Applications, to appear.Google Scholar
- 8.U. Dogrusoz and G. Sander. Graph visualization. ACM Computing Surveys, to appear.Google Scholar
- 11.P. Kikusts and P. Rucevskis. Layout algorithms of graph-like diagrams of GRADE windows graphic editors. In F.J. Brandenburg, editor, Graph Drawing (Proc. GD’ 95), volume 1027 of Lecture Notes in Computer Science, pages 361–364. Springer-Verlag, 1995.Google Scholar
- 12.T. Lengauer. Combinatorial algorithms for integrated circuit layout. John Wiley & Sons, 1990.Google Scholar