Disconnected Graph Layout and the Polyomino Packing Approach

  • Karlis Freivalds
  • Ugur Dogrusoz
  • Paulis Kikusts
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2265)

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.

References

  1. 1.
    B. S. Baker, E. G. Coffman, and R. S. Rivest. Orthogonal packings in two dimensions. SIAM Journal on Computing, 9(4):846–855, November 1980.MATHCrossRefMathSciNetGoogle Scholar
  2. 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
  3. 3.
    E. G. Coffman, M. R. Garey, D. S. Johnson, and R. E. Tarjan. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9(4):808–826, November 1990.CrossRefMathSciNetGoogle Scholar
  4. 4.
    E. G. Coffman and P. W. Shor. Packings in two dimensions: Asymptotic averagecase analysis of algorithms. Algorithmica, 9:253–277, 1993.MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235–282, 1994.MATHGoogle Scholar
  6. 6.
    U. Dogrusoz. Algorithms for layout of disconnected graphs. Information Sciences, to appear.Google Scholar
  7. 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. 8.
    U. Dogrusoz and G. Sander. Graph visualization. ACM Computing Surveys, to appear.Google Scholar
  9. 9.
    M. R. Garey and D. S. Johnson. Computers and Intractability,A Guide to the Theory of NP-completeness. Freeman, San Francisco, 1979.MATHGoogle Scholar
  10. 10.
    T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7–15, 1989.MATHCrossRefMathSciNetGoogle Scholar
  11. 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. 12.
    T. Lengauer. Combinatorial algorithms for integrated circuit layout. John Wiley & Sons, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Karlis Freivalds
    • 1
  • Ugur Dogrusoz
    • 2
  • Paulis Kikusts
    • 1
  1. 1.Institute of Mathematics and Computer ScienceUniv. of LatviaRigaLatvia
  2. 2.Computer Engineering DepartmentBilkent Univ.AnkaraTurkey

Personalised recommendations