Abstract
We consider the problem of representing size information in the edges and vertices of a planar graph. Such information can be used, for example, to depict a network of computers and information traveling through the network. We present an efficient linear-time algorithm which draws edges and vertices of varying 2-dimensional areas to represent the amount of information flowing through them. The algorithm avoids all occlusions of nodes and edges, while still drawing the graph on a compact integer grid.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Di Battista, G., Didimo, W., Patrignani, M., Pizzonia, M.: Orthogonal and quasi-upward drawings with vertices of prescribed size. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 297–310. Springer, Heidelberg (1999)
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1999)
Cheng, C., Duncan, C., Goodrich, M.T., Kobourov, S.: Drawing planar graphs with circular arcs. Discrete & Computational Geometry 25, 405–418 (2001)
Chrobak, M., Payne, T.: A linear-time algorithm for drawing planar graphs. Information Processing Letters 54, 241–246 (1995)
Duncan, C.A., Efrat, A., Kobourov, S.G., Wenk, C.: Drawing with fat edges. In: Proc. 9th Int. Symp. on Graph Drawing, pp. 162–177 (2001)
Eiglsperger, M., Kaufmann, M.: Fast Compaction for orthogonal drawings with vertices of prescribed size. In: Proc. 9th Int. Symp. on Graph Drawing, pp. 124–138 (2001)
Formann, M., Hagerup, T., Haralambides, J., Kaufmann, M., Leighton, F.T., Simvonis, A., Welzl, E., Woeginger, G.: Drawing graphs in the plane with high resolution. SIAM J. of Computing 22, 1035–1052 (1993)
de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10, 41–51 (1990)
Gansner, E.R., Koutsofios, E., North, S.C., Vo, K.P.: A technique for drawing directed graphs. IEEE Trans. on Software Engineering 19, 214–230 (1993)
Garg, A., Tamassia, R.: Planar drawings and angular resolution: Algorithms and bounds. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 12–23. Springer, Heidelberg (1994)
Goodrich, M.T., Wagner, C.: A framework for drawing planar graphs with curves and polylines. In: Proc. 6th Int. Symp. on Graph Drawing, pp. 153–166 (1998)
Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16, 4–32 (1996)
Klau, G.W., Mutzel, P.: Optimal compaction of orthogonal grid drawings. In: Cornuejols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 304–319. Springer, Heidelberg (1999)
Klau, G.W., Mutzel, P.: Combining graph labeling and compaction. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 27–37. Springer, Heidelberg (1999)
Malitz, S., Papakostas, A.: On the angular resolution of planar graphs. SIAM J. of Discrete Mathematics 7, 172–183 (1994)
Tufte, E.R.: The Visual Display of Quantitative Information. Graphics Press, Cheshire (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barequet, G., Goodrich, M.T., Riley, C. (2003). Drawing Graphs with Large Vertices and Thick Edges. In: Dehne, F., Sack, JR., Smid, M. (eds) Algorithms and Data Structures. WADS 2003. Lecture Notes in Computer Science, vol 2748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45078-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-45078-8_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40545-0
Online ISBN: 978-3-540-45078-8
eBook Packages: Springer Book Archive