Abstract
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by moving vertices. In this paper we investigate the related problem MinMovedVertices which asks for the minimum number of vertex moves. First, we show that MinMovedVertices is NP-hard and hard to approximate. Second, we establish a connection to the graph-drawing problem 1BendPointSetEmbeddability, which yields similar results for that problem. Third, we give bounds for the behavior of MinMovedVertices on trees and general planar graphs.
This work was started on the 9th “Korean” Workshop on Computational Geometry and Geometric Networks organized by A. Wolff and X. Goaoc, July 30–August 4, 2006 in Schloß Dagstuhl, Germany. Further contributions were made at the 2nd Workshop on Graph Drawing and Computational Geometry organized by W. Didimo and G. Liotta, March 11–16, 2007 in Bertinoro, Italy.
Chapter PDF
Similar content being viewed by others
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.
References
Erdős, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463–470 (1935)
Fáry, I.: On straight-line representation of planar graphs. Acta Sci. Math. (Szeged) 11, 229–233 (1948)
Goaoc, X., Kratochvíl, J., Okamoto, Y., Shin, C.-S., Wolff, A.: Moving vertices to make drawings plane (June 2007), http://arxiv.org/abs/0706.1002
Kang, M., Schacht, M., Verbitsky, O.: How much work does it take to straighten a plane graph out? (June 2007), http://arxiv.org/abs/0707.3373
Kaufmann, M., Wiese, R.: Embedding vertices at points: Few bends suffice for planar graphs. J. Graph Algorithms Appl. 6(1), 115–129 (2002)
Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. SIAM J. Discr. Math. 5(3), 422–427 (1992)
Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329–343 (1982)
Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. J. Visual Languages and Computing 6(2), 183–210 (1995)
Pach, J., Tardos, G.: Untangling a polygon. Discrete Comput. Geom. 28(4), 585–592 (2002)
Schensted, C.: Longest increasing and decreasing subsequences. Canadian Journal of Mathematics 13, 179–191 (1961)
Spillner, A., Wolff, A.: Untangling a planar graph (September 2007), http://arxiv.org/abs/0709.0170
Stein, S.K.: Convex maps. Proc. Amer. Math. Soc. 2, 464–466 (1951)
Tantalo, J.: Planarity (2007), http://planarity.net/
Verbitsky, O.: On the obfuscation complexity of planar graphs (May & June 2007), http://arxiv.org/abs/0705.3748
Wagner, K.: Bemerkungen zum Vierfarbenproblem. Jahresbericht Deutsch. Math.-Verein. 46, 26–32 (1936)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goaoc, X., Kratochvíl, J., Okamoto, Y., Shin, CS., Wolff, A. (2008). Moving Vertices to Make Drawings Plane. In: Hong, SH., Nishizeki, T., Quan, W. (eds) Graph Drawing. GD 2007. Lecture Notes in Computer Science, vol 4875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77537-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-77537-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77536-2
Online ISBN: 978-3-540-77537-9
eBook Packages: Computer ScienceComputer Science (R0)