 |
 |
 |
Conference papers
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.
Cited literature [11 references]
https://hal.inria.fr/inria-00181775
Contributor : Xavier Goaoc Connect in order to contact the contributor
Submitted on : Thursday, November 12, 2009 - 7:11:49 PM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM
Long-term archiving on: : Monday, September 24, 2012 - 2:31:15 PM
Contributor : Xavier Goaoc Connect in order to contact the contributor
Submitted on : Thursday, November 12, 2009 - 7:11:49 PM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM
Long-term archiving on: : Monday, September 24, 2012 - 2:31:15 PM
File
Vertex-move-gd07.pdf
Files produced by the author(s)
