The three-phase method: A unified approach to orthogonal graph drawing

  • Therese C. Biedl
  • Brendan P. Madden
  • Ioannis G. Tollis
Methodologies and Applications II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1353)

Abstract

In this paper, we study orthogonal graph drawings from a practical point of view. Most previously existing algorithms restricted the attention to graphs of maximum degree four. Here we study orthogonal drawing algorithms that work for any input graph, and discuss different models for such drawings. Then we introduce the three-phase method, a generic technique to create high-degree orthogonal drawings. This approach simplifies the description and implementation of orthogonal graph drawing, and can be applied to global as well as interactive and incremental settings.

References

  1. 1.
    T. Biedl. Orthogonal Graph Visualization: The Three-Phase Method With Applications. PhD thesis, RUTCOR, Rutgers University, May 1997.Google Scholar
  2. 2.
    T. Biedl and G. Kant. A better heuristic for orthogonal graph drawings. In 2nd European Symposium on Algorithms, volume 855 of Lecture Notes in Computer Science, pages 124–135. Springer Verlag, 1994.Google Scholar
  3. 3.
    T. Biedl and M. Kaufmann. Static and incremental high-degree orthogonal drawings. In 5th European Symposium on Algorithms, Lecture Notes in Computer Science. Springer Verlag, 1997. To appear.Google Scholar
  4. 4.
    F. Brandenburg, editor. Symposium on Graph Drawing 95, volume 1027 of Lecture Notes in Computer Science. Springer Verlag, 1996.Google Scholar
  5. 5.
    G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comp. Geometry: Theory and Applications, 4(5):235–282, 1994.Google Scholar
  6. 6.
    U. Fößmeier, G. Kant, and M. Kaufmann. 2-visibility drawings of planar graphs. In North [12], pages 155–168.Google Scholar
  7. 7.
    U. Fößmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In Brandenburg [4], pages 254–266.Google Scholar
  8. 8.
    G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16:4–32, 1996.Google Scholar
  9. 9.
    T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Teubner/Wiley & Sons, Stuttgart/Chicester, 1990.Google Scholar
  10. 10.
    K. Miriyala, S. Hornick, and R. Tamassia. An incremental approach to aesthetic graph layout. In 6th Intl. IEEE Workshop Computer-Aided Software Eng., 1993.Google Scholar
  11. 11.
    K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout adjustment and the mental map. J. Visual Languages and Computing, pages 183–210, June 1995.Google Scholar
  12. 12.
    S. North, editor. Symposium on Graph Drawing 96, volume 1190 of Lecture Notes in Computer Science. Springer Verlag, 1997.Google Scholar
  13. 13.
    A. Papakostas, J. M. Six, and I. Tollis. Experimental and theoretical results in interactive orthogonal graph drawing. In North [12], pages 371–386.Google Scholar
  14. 14.
    A. Papakostas and I. Tollis. Issues in interactive orthogonal graph drawing. In Brandenburg [4], pages 419–430.Google Scholar
  15. 15.
    A. Papakostas and I. Tollis. High-degree orthogonal drawings with small grid-size and few bends. In 5th Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science. Springer Verlag, 1997. To appear.Google Scholar
  16. 16.
    A. Papakostas and I. Tollis. A pairing technique for area-efficient orthogonal drawings. In North [12], pages 355–370.Google Scholar
  17. 17.
    P. Rosenstiehl and R. E. Tarjan. Rectilinear planar layouts and bipolar orientation of planar graphs. Discrete Computational Geometry, 1:343–353, 1986.Google Scholar
  18. 18.
    R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM Journal of Computing, 16(3):421–444, 1987.CrossRefGoogle Scholar
  19. 19.
    R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Systems, Man and Cybernetics, 18(1), 1988.Google Scholar
  20. 20.
    R. Tamassia and I. Tollis. A unified approach to visibility representations of planar graphs. Discrete Computational Geometry, 1:321–341, 1986.Google Scholar
  21. 21.
    R. Tamassia and I. Tollis, editors. DIMACS International Workshop, Graph Drawing 94, volume 894 of Lecture Notes in Computer Science. Springer Verlag, 1995.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Therese C. Biedl
    • 1
  • Brendan P. Madden
    • 2
  • Ioannis G. Tollis
    • 3
  1. 1.McGill UniversityMontreal
  2. 2.Tom Sawyer SoftwareBerkeley
  3. 3.Dept. Computer ScienceUniv. of Texas at DallasRichardson

Personalised recommendations