Abstract
It is well known that planar embeddings of 3-connected graphs are uniquely determined up to isomorphyof the induced complex of nodes, edges and faces of the plane or the 2-sphere [1]. Moreover, each of the isomorphyclasses of these embeddings contains a representative that has a convex polygon as outer border and has all edges embedded as straight lines. We fixate the outer polygon of such embeddings and regard each remaining edge e as a spring, its resilience being |e| k (|e| euclidean length of e, k∈IR, 1<k<∞). For 3-connected graphs, exactly one power-balanced embedding for each k exists, and this embedding is planar if and only if the graph with the fixated border polygon has a planar embedding inside that very polygon. For k =1 or k =∞, some faces may be collapsed; we call such embeddings quasi-planar [2]. It is possible to decide the planarity of anygraph embedding in linear time [3]. The motivation for this result was to develop a planaritytest that simultaneouslywith the decision process constructs a concrete planar embedding. This algorithm should work in three steps:
Chapter PDF
Similar content being viewed by others
References
Hotz, G.: Einbettung von Streckenkomplexen in die Ebene. Math. Annalen 167, 214–223 (1966)
Becker, B., Hotz, G.: On the Optimal Layout of Planar Graphs with Fixed Boundary. SIAM Journal on Computing 16(5), 946–972 (1987)
Becker-Groh, U., Hotz, G.: Ein Planaritätstest für planar-konvexe Grapheneinbettungen mit lin. Komplexität. Beiträge zur Algebra u. Geom. 18, 191–200 (1984)
Hotz, G., Reichert, A.: Hierarchischer Entwurf komplexer Systeme. Chapter 8 in: Wegener, I. (Ed.): Highlights aus der Informatik. Springer-Verlag (1996)
Osthof, H.-G.: Optimale Grapheinbettungen und ihre Anwendungen. Dissertation. Universität des Saarlandes (1990)
Fáry, I.: On Straight Line Representing of Planar Graphs. Acta Sci. Math. 11, 229–233 (1948)
Schnyder, W.: Embedding Planar Graphs on the Grid. Proc. 1st ACM-SIAM Symp. on Discrete Alg., 138–148 (1990)
Mehlhorn, K., Näher, S., Seel, M., Uhrig, C.: The LEDA User Manual (Version 3.7). Max-Planck-Institut für Informatik, Saarbrücken (1999)
Lohse, S.: Ein Planaritätstest und Einbettungsverfahren für Graphen. Diplomarbeit. Fachbereich Informatik, Universität des Saarlandes (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hotz, G., Lohse, S. (2002). Planarity Testing of Graphs on Base of a Spring Model. In: Mutzel, P., Jünger, M., Leipert, S. (eds) Graph Drawing. GD 2001. Lecture Notes in Computer Science, vol 2265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45848-4_51
Download citation
DOI: https://doi.org/10.1007/3-540-45848-4_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43309-5
Online ISBN: 978-3-540-45848-7
eBook Packages: Springer Book Archive