Moving vertices to make drawings plane

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/inria-00181775
Contributor : Xavier Goaoc <>
Submitted on : Thursday, November 12, 2009 - 7:11:49 PM
Last modification on : Wednesday, September 26, 2018 - 9:52:01 PM
Long-term archiving on : Monday, September 24, 2012 - 2:31:15 PM

File

Vertex-move-gd07.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff. Moving vertices to make drawings plane. 15th International Symposium on Graph Drawing, Sep 2007, Sydney, Australia. pp.101-112, ⟨10.1007/978-3-540-77537-9_13⟩. ⟨inria-00181775⟩

Share

Metrics

Record views

327

Files downloads

226