Advertisement

How to draw a planar clustered graph

  • Qing -Wen Feng
  • Robert F. Cohen
  • Peter Eades
Session 1B: Graph Drawing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 959)

Abstract

In this paper, we introduce and show how to draw a practical graph structure known as clustered graphs. We present an algorithm which produces planar, straight-line, convex drawings of clustered graphs in O(n2.5) time. We also demonstrate an area lower bound and an angle upper bound for straight-line convex drawings of C-planar graphs. We show that such drawings require Ω(2n) area and the smallest angle is O(1/n). Our bounds are unlike the area and angle bounds of classical graph drawing conventions in which area bound is Ω(n2) and angle bounds are functions of the maximum degree of the graph. Our results indicate important tradeoff between line straightness and area, and between region convexity and area.

Keywords

Planar Graph Outer Face Classical Graph Cluster Graph Planar Drawing 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    G. Di Battista, P. Eades, and R. Tamassia. Algorithms for drawing graphs: an annotated bibliography. Technical report, Department of Computer Science, Brown University, 1993. To appear in Computational Geometry and Applications.Google Scholar
  2. 2.
    G. Di Battista, R. Tamassia, and I. G. Tollis. Area requirement and symmetry disdplay of planar upward drawings. Discrete & Computational Geometry, 7:381–401, 1992.Google Scholar
  3. 3.
    Claude Berge. Hypergraphs. North-Holland, 1989.Google Scholar
  4. 4.
    H. de Fraysseiz, J. Pach, and R. Pollack. Small sets supporting fary embeddings of planar graphs. In Proc. 20th ACM Symposium on Theory of Computing, pages 426–433, 1988.Google Scholar
  5. 5.
    Qing-Wen Feng, Peter Eades, and Robert F. Cohen. Clustered graphs and cplanarity. Technical Report 04, Department of Computer Science, The University of Newcastle, Australia, 1995.Google Scholar
  6. 6.
    M. Formann, T. Hagerup, J. Haralambides, M. Kaufmann, F.T. Leighton, A. Simvonis, E. Welzl, and G. Woeginger. Drawing graphs in the plane with high resolution. In Proc. 31th IEEE Symp. on Foundations of Computer Science, pages 86–95, 1990.Google Scholar
  7. 7.
    Patrick L. Garvan. Drawing 3-connected planar graphs as convex polyhedra. Technical Report 02, Department of Computer Science, The University of Newcastle, Australia, 1995.Google Scholar
  8. 8.
    D. Harel. On visual formalisms. Communications of the ACM, 31(5):514–530, 1988.CrossRefGoogle Scholar
  9. 9.
    T. Kamada. Visualizing Abstract Objects and Relations. World Scientific Series in Computer Science, 1989.Google Scholar
  10. 10.
    G. Kant. Drawing planar graphs using the lmc-ordering. In Proc. 33th IEEE Symp. on Foundations of Computer Science, pages 101–110, 1992.Google Scholar
  11. 11.
    J. Kawakita. The KJ method — a scientific approach to problem solving. Technical report, Kawakita Research Institute, Tokyo, 1975.Google Scholar
  12. 12.
    Wei Lai. Building Interactive Digram Applications. PhD thesis, Department of Computer Science, University of Newcastle, Callaghan, New South Wales, Australia, 2308, June 1993.Google Scholar
  13. 13.
    R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM J. Numer. Anal., 16(2):346–258, 1979.CrossRefGoogle Scholar
  14. 14.
    S. Malitz and A. Papakostas. On the angular resolution of planar graphs. In Proc. 24th ACM Symp. on Theory of Computing, pages 527–538, 1992.Google Scholar
  15. 15.
    K. Misue and K. Sugiyama. An overview of diagram based idea organizer: D-abductor. Technical Report IIAS-RR-93-3E, ISIS, Fujitsu Laboratories, 1993.Google Scholar
  16. 16.
    S. C. North. Drawing ranked digraphs with recursive clusters. preprint, 1993. Software Systems and Research Center, AT & T Laboratories.Google Scholar
  17. 17.
    Tom Sawyer Software. Graph layout toolkit. available from bmadden@TomSawyer.COM.Google Scholar
  18. 18.
    K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Man and Cybernetics, 21(4):876–892, 1991.Google Scholar
  19. 19.
    W. T. Tutte. How to draw a graph. Proceedings of the London Mathematical Society, 3(13):743–768, 1963.Google Scholar
  20. 20.
    Rebecca Wirfs-Brock, Brian Wilkerson, and Lauren Wiener. Designing Object-Oriented Software. P T R Prentics Hall, Englewood Cliffs, NJ 07632, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Qing -Wen Feng
    • 1
  • Robert F. Cohen
    • 1
  • Peter Eades
    • 1
  1. 1.Department of Computer ScienceUniversity of NewcastleCallaghanAustralia

Personalised recommendations