Abstract
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given and another in which the mapping is not given. In particular, given a mapping, we show how to embed two paths on an n ×n grid, and two caterpillar graphs on a 3n ×3n grid. We show that it is not always possible to simultaneously embed three paths. If the mapping is not given, we show that any number of outerplanar graphs can be embedded simultaneously on an O(n) ×O(n) grid, and an outerplanar and general planar graph can be embedded simultaneously on an O(n 2) ×O(n 2) grid.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bern, M., Gilbert, J.R.: Drawing the planar dual. Information Processing Letters 43(1), 7–13 (1992)
Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Combin. Theory, Ser. B 27, 320–331 (1979)
Bose, P.: On embedding an outer-planar graph in a point set. CGTA: Computational Geometry: Theory and Applications 23(3), 303–312 (2002)
Brightwell, G.R., Scheinerman, E.R.: Representations of planar graphs. SIAM Journal on Discrete Mathematics 6(2), 214–229 (1993)
Cenek, E.: Layered and Stratified Graphs. PhD thesis, University of Waterloo (forthcoming)
Chrobak, M., Goodrich, M.T., Tamassia, R.: Convex drawings of graphs in two and three dimensions. In: Proc. 12th Annu. ACM Sympos. Comput. Geom., pp. 319–328 (1996)
Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. Intl. Journal of Computational Geometry and Applications 7(3), 211–223 (1997)
Collberg, C., Kobourov, S.G., Nagra, J., Pitts, J., Wampler, K.: A system for graph-based visualization of the evolution of software. In: 1st ACM Symposium on Software Visualization (2003) (to appear)
de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1999)
Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. Journal of Graph Algorithms and Applications 4(3), 5–17 (2000)
Erdös, P.: Appendix. In: Roth, K.F. (ed.) On a problem of Heilbronn. J. London Math. Soc., vol. 26, pp. 198–204 (1951)
Erten, C., Kobourov, S.G.: Simultaneous embedding of a planar graph and its dual on the grid. In: 13th Intl. Symp. on Algorithms and Computation (ISAAC), pp. 575–587 (2002)
Gritzmann, P., Mohar, B., Pach, J., Pollack, R.: Embedding a planar triangulation with vertices at specified points. American Math. Monthly 98, 165–166 (1991)
Kaufmann, M., Wagner, D.: Drawing Graphs. LNCS, vol. 2025. Springer, New York (2001)
Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte uber die Verhandlungen der Sächsischen Akademie der Wissenschaften zu Leipzig. Math. Phys. Klasse 88, 141–164 (1936)
Miura, K., Nakano, S.-I., Nishizeki, T.: Grid drawings of 4-connected plane graphs. Discrete and Computational Geometry 26(1), 73–87 (2001)
Mutzel, P., Odenthal, T., Scharbrodt, M.: The thickness of graphs: a survey. Graphs Combin. 14(1), 59–73 (1998)
Schnyder, W.: Planar graphs and poset dimension. Order 5(4), 323–343 (1989)
Tutte, W.T.: How to draw a graph. Proc. London Math. Society 13(52), 743–768 (1963)
Yannakakis, M.: Embedding planar graphs in four pages. Journal of Computer and System Sciences 38(1), 36–67 (1989)
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
Brass, P. et al. (2003). On Simultaneous Planar Graph Embeddings. 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_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-45078-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40545-0
Online ISBN: 978-3-540-45078-8
eBook Packages: Springer Book Archive