Moving vertices to make drawings plane

X. Goaoc, J. Kratochvil, Y. Okamoto, C.S. Shin, A. Wolff

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

6 Citations (Scopus)


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.
Original languageEnglish
Title of host publicationGraph Drawing (15th International Symposium, GD'07, Sydney, Australia, September 23-26, 2007, Revised Papers)
EditorsS.K. Hong, T. Nishizeki, W. Quan
Place of PublicationBerlin
ISBN (Print)978-3-540-77536-2
Publication statusPublished - 2008

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Dive into the research topics of 'Moving vertices to make drawings plane'. Together they form a unique fingerprint.

Cite this