Advertisement

Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints

  • Seok-Hee Hong
  • Martin Mader
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5417)

Abstract

In this paper we present a generalization of the shift method algorithm [4,6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a certain specified size. We propose vertex representations having a rectangular shape. Additionally, one may demand maintainance of the criterion of strong visibility, that is, any possible line segment connecting two adjacent vertices cannot cross another vertex’ representation. We prove that the proposed method produces a straight-line grid drawing of a graph in linear time with an area bound, that is only extended by the size of the rectangles, compared to the bound of the original algorithm.

References

  1. 1.
    Barequet, G., Goodrich, M.T., Riley, C.: Drawing planar graphs with large vertices and thick edges. J. Graph Algorithms Appl. 8, 3–20 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)zbMATHGoogle Scholar
  3. 3.
    Chrobak, M., Payne, T.H.: A linear-time algorithm for drawing a planar graph on a grid. Information Processing Letters 54(4), 241–246 (1995)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Harel, D., Sardas, M.: An algorithm for straight-line drawing of planar graphs. Algorithmica 20(2), 119–135 (1998)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16(1), 4–32 (1996)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Kaufmann, M., Wagner, D. (eds.): Drawing graphs: Methods and Models. Springer, London (2001)Google Scholar
  8. 8.
    Mader, M., Hong, S.: Drawing planar clustered graphs in 2.5 dimensions. Tech. rep., NICTA (2007), http://www.cs.usyd.edu.au/~visual/valacon/
  9. 9.
    Nishizeki, T., Rahman, S.: Planar Graph Drawing. Lecture Note Series on Computing, vol. 12. World Scientific, Singapore (2004)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Seok-Hee Hong
    • 1
  • Martin Mader
    • 2
  1. 1.School of ITUniversity of Sydney, NSWAustralia
  2. 2.Department of Computer and Information ScienceUniversity of KonstanzGermany

Personalised recommendations