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
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
Claude Berge. Hypergraphs. North-Holland, 1989.
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.
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.
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.
Patrick L. Garvan. Drawing 3-connected planar graphs as convex polyhedra. Technical Report 02, Department of Computer Science, The University of Newcastle, Australia, 1995.
D. Harel. On visual formalisms. Communications of the ACM, 31(5):514–530, 1988.
T. Kamada. Visualizing Abstract Objects and Relations. World Scientific Series in Computer Science, 1989.
G. Kant. Drawing planar graphs using the lmc-ordering. In Proc. 33th IEEE Symp. on Foundations of Computer Science, pages 101–110, 1992.
J. Kawakita. The KJ method — a scientific approach to problem solving. Technical report, Kawakita Research Institute, Tokyo, 1975.
Wei Lai. Building Interactive Digram Applications. PhD thesis, Department of Computer Science, University of Newcastle, Callaghan, New South Wales, Australia, 2308, June 1993.
R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM J. Numer. Anal., 16(2):346–258, 1979.
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.
K. Misue and K. Sugiyama. An overview of diagram based idea organizer: D-abductor. Technical Report IIAS-RR-93-3E, ISIS, Fujitsu Laboratories, 1993.
S. C. North. Drawing ranked digraphs with recursive clusters. preprint, 1993. Software Systems and Research Center, AT & T Laboratories.
Tom Sawyer Software. Graph layout toolkit. available from bmadden@TomSawyer.COM.
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.
W. T. Tutte. How to draw a graph. Proceedings of the London Mathematical Society, 3(13):743–768, 1963.
Rebecca Wirfs-Brock, Brian Wilkerson, and Lauren Wiener. Designing Object-Oriented Software. P T R Prentics Hall, Englewood Cliffs, NJ 07632, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feng, Q.W., Cohen, R.F., Eades, P. (1995). How to draw a planar clustered graph. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030816
Download citation
DOI: https://doi.org/10.1007/BFb0030816
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive