Advertisement

Partitioned Drawings

  • Martin Siebenhaller
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4372)

Abstract

In this paper we consider the problem of creating partitioned drawings of graphs. In a partitioned drawing each vertex is placed inside a given partition cell of a rectangular partition of the drawing area. This problem has several applications in practice, e.g. for UML activity diagrams or wiring schematics. We first formalize the problem and analyze its complexity. Then we give a heuristic approach which is based on the topology-shape-metrics approach and produces partitioned drawings in time O((|V| + c)2log(|V| + c)), where c denotes the number of crossings.

Keywords

Planar Graph Directed Edge Graph Drawing Planar Embedding Partition Cell 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full conference paper text

References

  1. 1.
    Brandes, U., Eiglsperger, M., Kaufmann, M., Wagner, D.: Sketch-driven orthogonal graph drawing. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 1–12. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  2. 2.
    Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)zbMATHGoogle Scholar
  3. 3.
    Eiglsperger, M.: Automatic Layout of UML Class Diagrams: A Topology-Shape-Metrics Approach. PhD thesis, Universität Tübingen (2003)Google Scholar
  4. 4.
    Eiglsperger, M., Siebenhaller, M., Kaufmann, M.: An efficient implementation of Sugiyama’s algorithm for layered graph drawing. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 155–166. Springer, Heidelberg (2005)Google Scholar
  5. 5.
    Fößmeier, U., Kaufmann, M.: Drawing high degree graphs with low bend numbers. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 254–266. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  6. 6.
    Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods 4, 312–316 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Hopcroft, J.E., Tarjan, R.E.: Efficient planarity testing. Journal of the ACM 21(4), 549–568 (1974)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 263–274. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  9. 9.
    Siebenhaller, M., Kaufmann, M.: Mixed upward planarization - fast and robust. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 522–523. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    yWorks. yFiles - a java graph layout and visualization library (WWW document) http://www.yworks.com (accessed September 2006)

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Martin Siebenhaller
    • 1
  1. 1.Universität Tübingen, WSI für Informatik, Sand 13, 72076 TübingenGermany

Personalised recommendations

Cite paper